Submission #1272505
Source Code Expand
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int
#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))
typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;
typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
int const MOD = 1000000007;
ll mod_pow(ll x, ll n) {return (!n)?1:(mod_pow((x*x)%MOD,n/2)*((n&1)?x:1))%MOD;}
int madd(int a, int b) {return (a + b) % MOD;}
int msub(int a, int b) {return (a - b + MOD) % MOD;}
int mmul(int a, int b) {return (a * b) % MOD;}
int minv(int a) {return mod_pow(a, MOD-2);}
int mdiv(int a, int b) {return mmul(a, minv(b));}
namespace std {
bool operator<(const P& a, const P& b) {
return a.X != b.X ? a.X < b.X : a.Y < b.Y;
}
}
int w, h;
signed main() {
cin >> w >> h;
vector<pii> v;
rep(i,0,w) {
int p; cin >> p;
v.push_back(pii(p, 0));
}
rep(i,0,h) {
int q; cin >> q;
v.push_back(pii(q, 1));
}
sort(v.begin(), v.end());
int a = w+1, b = h+1, ans = 0;
rep(i,0,v.size()) {
if(v[i].second == 0) {
ans += b * v[i].first;
a--;
}
else {
ans += a * v[i].first;
b--;
}
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Gr-idian MST |
User |
tsutaj |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
2339 Byte |
Status |
AC |
Exec Time |
102 ms |
Memory |
6384 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
500 / 500 |
Status |
|
|
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 |
AC |
91 ms |
6256 KB |
02.txt |
AC |
92 ms |
6128 KB |
03.txt |
AC |
91 ms |
5616 KB |
04.txt |
AC |
102 ms |
6256 KB |
05.txt |
AC |
91 ms |
4592 KB |
06.txt |
AC |
92 ms |
5488 KB |
07.txt |
AC |
91 ms |
6256 KB |
08.txt |
AC |
91 ms |
6256 KB |
09.txt |
AC |
91 ms |
6384 KB |
10.txt |
AC |
91 ms |
5616 KB |
11.txt |
AC |
89 ms |
4592 KB |
12.txt |
AC |
93 ms |
5232 KB |
13.txt |
AC |
94 ms |
5360 KB |
14.txt |
AC |
93 ms |
6128 KB |
15.txt |
AC |
90 ms |
5232 KB |
16.txt |
AC |
47 ms |
2420 KB |
17.txt |
AC |
47 ms |
2420 KB |
18.txt |
AC |
46 ms |
2420 KB |
19.txt |
AC |
46 ms |
2420 KB |
20.txt |
AC |
39 ms |
6000 KB |
21.txt |
AC |
64 ms |
6256 KB |
22.txt |
AC |
64 ms |
4976 KB |
23.txt |
AC |
78 ms |
6256 KB |
24.txt |
AC |
87 ms |
6256 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 |