Submission #3263569

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i=(int)(a); i!=(int)(b); i++)
#define RFOR(i, a, b) for(int i=(int)(a); i!=(int)(b); i--)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
using ll = long long;

int main(){
  int w, h; cin >> w >> h;
  ll p[w], q[h];
  pair<ll, int> r[w+h];
  REP(i, w){
    cin >> p[i];
    r[i] = {p[i], 0};
  }
  REP(i, h){
    cin >> q[i];
    r[i+w] = {q[i], 1};
  }

  sort(r, r+w+h);

  ll cost = 0, a = w+1, b = h+1;
  REP(i, w+h){
    if(r[i].second){
      cost += b*r[i].first;
      a--;
    }
    else{
      cost += a*r[i].first;
      b--;
    }
  }

  cout << cost << endl;

  return 0;
}

Submission Info

Judge Result