Submission #3247484

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include <time.h>
#include <tuple>
#include <iomanip>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e12;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1

ll sq(ll num) { return num*num; }
ll mod_pow(ll x, ll n) {
	if (n == 0)return 1;
	if (n == 1)return x%MOD;
	ll res = sq(mod_pow(x, n / 2));
	res %= MOD;
	if (n % 2 == 1) {
		res *= x;
		res %= MOD;
	}
	return res;
}
ll mod_add(ll a, ll b) { return (a + b) % MOD; }
ll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }
ll mod_mul(ll a, ll b) { return a*b % MOD; }

int h,w;

int main(){
	cin >> h >> w;
	vector<P> p;
	rep(i,h){
		ll num;
		cin >> num;
		p.push_back(P(num,0));
	}
	rep(i,w){
		ll num;
		cin >> num;
		p.push_back(P(num,1));
	}
	sort(ALL(p));
	ll cnt[2] = {};
	ll def = 0;
	ll prev = p[0].second;
	ll ans = 0;
	rep(i,p.size()){
		ll num = p[i].first;
		bool now = p[i].second;
		if(prev != now)def = cnt[prev];
		cnt[now]++;
		prev = now;
		if(now == 0)num *= (w+1-def);
		else num *= (h+1-def);
		// cout << "!"<< num << endl;
		ans += num;
		prev = now;
	}
	cout << ans << endl;
}

Submission Info

Judge Result