Submission #1652919

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
  int w,h;
  cin >> w >> h;
  
  vector<int> p(w+1), q(h+1);
  for(int i=0; i<w; i++){
    cin >> p[i];
  }
  for(int i=0; i<h; i++){
    cin >> q[i];
  }
  p[w] = q[h] = 1e9;

  sort(p.begin(), p.end());
  sort(q.begin(), q.end());
  
  long long int ans=0;
  int pidx=0, qidx=0;
  while(!(w==0 && h==0)){
    if(p[pidx]*(h+1) < q[qidx]*(w+1)){
      ans += p[pidx]*(h+1);
      w--;
      pidx++;
    }else{
      ans += q[qidx]*(w+1);
      h--;
      qidx++;
    }
  }

  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result