Submission #1789880


Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<string>
#include<sstream>
#include<cmath>
#include<climits>
#include<algorithm>
#include<bitset>
#include<set>
#include<stack>
#include<queue>
#include<iomanip>
#include<memory.h>
#include<complex>
#include<unordered_map>
using namespace std;  
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef tuple<int,int> tii;
#define rep(i,n) for(int i=0;i<(n);i++)  
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second  
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
const double PI = M_PI;  
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cerr<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" "))
#define DIV int(1e9+7)
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}
/* Coding Space*/
map<char,int> m;
int main(){
  int w,h; cin >> w >> h;
  vector<tii> v;
  rep(i,w){
    int p; cin >> p;
    v.pb(tii{p,0});
  }
  rep(i,h){
    int q; cin >> q;
    v.pb(tii{q,1});
  }
  ll ans = 0;
  sort(ALL(v));
  rep(i,(int)v.size()){
    int c,type; tie(c,type) = v[i];
    if(type == 0){
      ans += (h+1)*c;
      w--;
    }else{
      ans += (w+1)*c;
      h--;
    }
  }
  cout << ans << endl;
}

Submission Info

Submission Time
Task C - Gr-idian MST
User cashisu1
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1534 Byte
Status WA
Exec Time 92 ms
Memory 3444 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
AC × 9
WA × 21
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt WA 91 ms 2420 KB
02.txt WA 91 ms 2420 KB
03.txt WA 90 ms 2420 KB
04.txt WA 90 ms 2420 KB
05.txt WA 90 ms 2420 KB
06.txt WA 91 ms 2420 KB
07.txt WA 91 ms 2420 KB
08.txt WA 91 ms 2420 KB
09.txt WA 91 ms 2420 KB
10.txt WA 91 ms 2420 KB
11.txt WA 89 ms 2420 KB
12.txt WA 89 ms 2420 KB
13.txt WA 92 ms 2420 KB
14.txt WA 89 ms 3444 KB
15.txt WA 90 ms 2420 KB
16.txt WA 45 ms 1400 KB
17.txt WA 45 ms 1400 KB
18.txt WA 45 ms 1400 KB
19.txt WA 45 ms 1400 KB
20.txt AC 39 ms 2420 KB
21.txt AC 64 ms 2420 KB
22.txt AC 65 ms 2420 KB
23.txt WA 74 ms 2420 KB
24.txt WA 87 ms 2420 KB
25.txt AC 1 ms 256 KB
26.txt AC 1 ms 256 KB
27.txt AC 1 ms 256 KB
28.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB