Submission #1007280

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

int main() {
  int w, h;
  scanf("%d %d", &w, &h);
  vi p(w+h);
  deque<vi> c(w+h, vi(2));
  rep (i, w+h) {
    scanf("%d", &p[i]);
    c[i][0] = p[i];
    c[i][1] = i;
  }
  sort(all(c));
  ll cost = 0;
  int cw = 0;
  int ch = 0;
  rep (i, w+h) {
    vi edge = c[i];
    ll num_edge;
    if (edge[1] < w) {
      num_edge = h + 1 - ch;
      cw += 1;
    } else {
      num_edge = w + 1 - cw;
      ch += 1;
    }
    cost += num_edge * edge[0];
  }
  printf("%lld\n", cost);
  return 0;
}

Submission Info

Judge Result