forked from daiwb/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path203.cpp
More file actions
48 lines (44 loc) · 886 Bytes
/
203.cpp
File metadata and controls
48 lines (44 loc) · 886 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
//ac
#include <iostream>
#include <cstdio>
#include <queue>
#include <deque>
#include <vector>
using namespace std;
#define for if(0); else for
const int MAXN = 500000;
long long mm[2][MAXN];
int main() {
int n;
int num[2] = {0, 0};
int idx[2] = {0, 0};
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
int a;
scanf("%d", &a);
mm[0][num[0]++] = a;
}
num[0] = n;
long long ret = 0;
for (int ii = 0; ii < n - 1; ++ii) {
long long p = 0;
for (int i = 0; i < 2; ++i) {
if (idx[0] == num[0]) {
ret += mm[1][idx[1]];
p += mm[1][idx[1]++];
} else if (idx[1] == num[1]) {
ret += mm[0][idx[0]];
p += mm[0][idx[0]++];
} else if (mm[1][idx[1]] < mm[0][idx[0]]) {
ret += mm[1][idx[1]];
p += mm[1][idx[1]++];
} else {
ret += mm[0][idx[0]];
p += mm[0][idx[0]++];
}
}
mm[1][num[1]++] = p;
}
printf("%lld\n", ret);
return 0;
}