Submission #3238719
Source Code Expand
#include <iostream> #include <stdio.h> #include <fstream> #include <algorithm> #include <string> #include <map> #include <set> #include <queue> #include <stack> #include <vector> #include <limits.h> #include <math.h> #include <functional> #include <bitset> #define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i)) #define debug(x) cerr << #x << ": " << x << '\n' #define debugArray(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << "[" << i << "]: " << x[i] << '\n' #define debugArrayP(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << "[" << i << "]: " << x[i].first<< " " << x[i].second << '\n' using namespace std; typedef long long ll; typedef pair<int,int> Pii; typedef vector<int> vint; typedef vector<ll> vll; const ll INF = LLONG_MAX/10; const ll MOD = 1e9+7; int main(){ ll W,H;cin >> W>>H; vll p(W),q(H); repeat(i,W){ cin >> p[i]; } repeat(i,H){ cin >> q[i]; } sort(p.begin(),p.end()); sort(q.begin(),q.end()); ll pi=0,qi=0; ll ans = 0; repeat(i,W+H){ ll pa = pi<W? p[pi]*(H+1-qi):INF; ll qa = qi<H? q[qi]*(W+1-pi):INF; if(pa<qa){ ans += pa; pi++; }else{ ans += qa; qi++; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Gr-idian MST |
User | hashiryo |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1281 Byte |
Status | WA |
Exec Time | 87 ms |
Memory | 1792 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 87 ms | 1792 KB |
02.txt | WA | 86 ms | 1792 KB |
03.txt | WA | 86 ms | 1792 KB |
04.txt | WA | 87 ms | 1792 KB |
05.txt | WA | 87 ms | 1792 KB |
06.txt | WA | 87 ms | 1792 KB |
07.txt | WA | 87 ms | 1792 KB |
08.txt | WA | 87 ms | 1792 KB |
09.txt | WA | 87 ms | 1792 KB |
10.txt | WA | 87 ms | 1792 KB |
11.txt | WA | 82 ms | 1792 KB |
12.txt | WA | 82 ms | 1792 KB |
13.txt | WA | 77 ms | 1792 KB |
14.txt | WA | 87 ms | 1792 KB |
15.txt | WA | 87 ms | 1792 KB |
16.txt | WA | 44 ms | 1024 KB |
17.txt | WA | 44 ms | 1024 KB |
18.txt | WA | 45 ms | 1024 KB |
19.txt | WA | 44 ms | 1024 KB |
20.txt | AC | 34 ms | 1792 KB |
21.txt | WA | 60 ms | 1792 KB |
22.txt | WA | 60 ms | 1792 KB |
23.txt | AC | 59 ms | 1792 KB |
24.txt | AC | 82 ms | 1792 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 |