45105
56 94
38 17
45 46
94 65
42 77
4 31
71 51
49 31
82 9
11 62
33 30
50 19
52 61
32 8
<308494 bytes omitted>用户输出
1642832666Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #24080 | #1022. jwp的排队难题 | Wrong Answer | 0 | 85 ms | 1088 K | C++ 11 / 352 B | 电类935-郑新宇 | 2020-03-19 8:13:33 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int n, sum;
struct peo {
int a, b;
} kk[100010];
bool cmp(peo x, peo y) { return x.a > y.a; }
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> kk[i].a >> kk[i].b;
sort(kk + 1, kk + n + 1, cmp);
for (int i = 1; i <= n; i++) sum += kk[i].a * (kk[i].b += kk[i - 1].b);
cout << sum;
return 0;
}
45105
56 94
38 17
45 46
94 65
42 77
4 31
71 51
49 31
82 9
11 62
33 30
50 19
52 61
32 8
<308494 bytes omitted>用户输出
1642832666Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 06667
81 6
83 71
57 69
97 27
5 84
20 77
28 77
77 57
97 49
40 18
78 39
41 69
14 11
99 1
<45515 bytes omitted>用户输出
-915700454Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 055457
60 47
63 7
81 14
91 88
2 83
4 35
80 77
55 46
97 57
65 10
56 14
15 43
88 3
19 62
<379227 bytes omitted>用户输出
-947837127Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 054839
31 85
77 24
87 83
9 18
35 74
88 40
59 14
47 63
50 31
17 40
1 23
71 10
43 69
24 1
<374961 bytes omitted>用户输出
2112226657Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0