Submission #1349135

---

Source Code Expand

//#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#define MOD 1000000007
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

ll p[100010], q[100010], pp[100010];
signed main(void)
{
	int w, h;
	cin >> w >> h;
	REP(i, w) cin >> q[i];
	REP(i, h) cin >> p[i];
	p[h] = 0;
	sort(p, p+h+1);
	REP(i, h+1) pp[i] = p[i];
	//pの累積和
	FOR(i, 1, h+1) pp[i] += pp[i-1];
	//REP(i, h+1) cout << p[i] << " "; cout << endl;
	//REP(i, h+1) cout << pp[i] << " "; cout << endl;

	ll ans = pp[h];
	REP(i, w) {
		int itr = upper_bound(p, p+h+1, q[i]) - p - 1;
		ans += pp[itr] + (h+1-itr)*q[i];
		//cout << itr << " " << ans << endl;
	}
	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result