Submission #1244196

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

int main(void) {

	int w, h;
	cin >> w >> h;

	vector< pair<int, char> > edge(w + h, make_pair(0, '*'));
	for (int i = 0; i < w; ++i) {
		cin >> edge[i].first;
		edge[i].second = 'x';
	}
	for (int i = w; i < w + h; ++i) {
		cin >> edge[i].first;
		edge[i].second = 'y';
	}
	sort(edge.begin(), edge.end());


	long long x = w + 1, y = h + 1;
	long long sum = 0, num = 0, total = x * y - 1; 

	for (int i = 0; i < edge.size(); ++i) {
		if (edge[i].second == 'x') {
			sum += edge[i].first * y;
			num += y;
			--x;
			if (num >= total) {
				sum -= edge[i].first * (num - total);
				break;
			}
		}
		if (edge[i].second == 'y') {
			sum += edge[i].first * x;
			num += x;
			--y;
			if (num >= total) {
				sum -= edge[i].first * (num - total);
				break;
			}
		}
	}

	cout << sum << endl;
	return 0;

}

Submission Info

Judge Result