Submission #75822961

---

Source Code Expand

#include <iostream>
#include<vector>

using namespace std;

int N;
vector<pair<int, int>> SC;
long long Ssum = 0, Csum = 0;

pair<int, int> func(int start = 0,int last=N) {
	if (start == last)
		return { 0,0 };
	if (start + 1 == last)
		return SC[start];
	int mid=0,midin=SC[mid].first,m;
	for (int i = start; last > i; ++i) {
		m = min(SC[i].first, SC[i].second);
		if(midin>m)
			mid = i, midin= m;
	}
	pair<int, int> p1=func(start,mid), p2=func(mid,last);
	int s1 = max(p1.first, p2.first),
		c1 = min(p1.second, p2.second),
		s2 = min(p1.first, p2.first),
		c2 = max(p1.second, p2.second);
	if ((Ssum - s1) * (Csum - c1) < (Ssum - s2) * (Csum - c2))
		return { s1,c1 };
	else
		return { s2,c2 };
}

int main() {
	cin >> N;
	int s, c;
	for (int i = 0; N > i; ++i) {
		cin >> s >> c;
		SC.push_back({ s,c });
		Ssum += s;
		Csum += c;
	}

	pair<int,int> P = func();
	
	cout << (Ssum - P.first) * (Csum - P.second);
}

Submission Info

Judge Result