Submission #1274351

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

vector<pair<int, int>> arr;

int main( void ) {
    
    int w, h;
    cin >> w >> h;
    
    for( int i = 1; i <= w; i ++ ) {
        int x;
        cin >> x;
        
        arr.push_back( make_pair( x, 0 ) );
    }
    
    for( int i = 1; i <= h; i ++ ) {
        int x;
        cin >> x;
        
        arr.push_back( make_pair( x, 1 ) );
    }
    
    w ++; h ++;
    sort( arr.begin(), arr.end() );
    
    long long ans = 0;
    for( pair<int, int> pr : arr ) {
        if( pr.second == 0 ) {
            ans += 1LL * pr.first * h;
            w --;
        }
        else {
            ans += 1LL * pr.first * w;
            h --;
        }
    }
    
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result