Submission #1753342

---

Source Code Expand

#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define LOOP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define MP make_pair
#define FIR first
#define SEC second
#define int long long
using namespace std;
const int MOD=1000000007;
const int INF=1000000009;


signed main(){
  int w,h,p;
  cin>>w>>h;
  vector<pair<int,int>> v;

  REP(i,w){
    cin>>p;
    v.PB(MP(p,0));
  }
  REP(i,h){
    cin>>p;
    v.PB(MP(p,1));
  }
  sort(ALL(v));
  int sum=0,tmp;
  int pre=v[0].SEC;
  if(pre==0){
    tmp=h+1;
  }else{
    tmp=w+1;
  }
  sum+=tmp*v[0].FIR;
  LOOP(i,1,w+h){
    if(pre==v[i].SEC){
      sum+=tmp*v[i].FIR;
      pre=v[i].SEC;
    }else{
      tmp-=1;
      sum+=tmp*v[i].FIR;
      pre=v[i].SEC;
    }
  }
  cout<<sum<<endl;
  return 0;
}

Submission Info

Judge Result