Submission #921058

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
typedef pair<int, int> P;

signed main(){
	int w, h;
	cin >> w >> h;
	vector<int> p(w), q(h);
	priority_queue<P, vector<P>, greater<P> > pq;	
	rep(i, 0, w){
		cin >> p[i];
		pq.push(P(p[i], 1));
	}
	rep(i, 0, h){
		cin >> q[i];
		pq.push(P(q[i], -1));
	}
	int ans = 0;
	while(pq.size()){
		P now = pq.top(); pq.pop();
		if(now.second == 1){
			ans += (h + 1) * now.first;
			w--;
		}else{
			ans += (w + 1) * now.first;
			h--;
		}
	}
	cout << ans << endl;
}

Submission Info

Judge Result