class Solution
{
public:
int minimumCost(int m, int n, vector<int> &horizontalCut, vector<int> &verticalCut)
{
int res = std::accumulate(horizontalCut.begin(), horizontalCut.end(), 0) + std::accumulate(verticalCut.begin(), verticalCut.end(), 0);
for (const auto &hc: horizontalCut)
{
for (const auto &vc: verticalCut)
{
res += std::min({hc, vc});
}
}
return res;
}
};
