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>用户输出
453223018Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #47388 | #1022. jwp的排队难题 | Wrong Answer | 0 | 109 ms | 1088 K | C++ / 467 B | DWW | 2021-04-01 19:45:01 |
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e5 + 1;
struct node {
int a, b;
} arr[N];
bool cmp(node x, node y) { return x.a * y.b > x.b * y.a; }
int main() {
int n, anger, result = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i].a >> arr[i].b;
}
sort(arr, arr + n, cmp);
for (int i = 0; i < n; i++) {
anger += arr[i].b;
result += anger * arr[i].a;
}
cout << result;
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>用户输出
453223018Special 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>用户输出
-395280664Special 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>用户输出
1889448029Special 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>用户输出
1860457139Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0