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>用户输出
1723325895046Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #80605 | #1022. jwp的排队难题 | Wrong Answer | 0 | 64 ms | 1776 K | C++ 17 / 417 B | xiangyining | 2022-07-18 13:55:06 |
#include <cstdio>
#include <algorithm>
using namespace std;
struct node {
long long a, b;
} y[100005];
bool cmp(node q, node p) { return q.a * p.b > q.b * q.a; }
int main() {
long long n, ans = 0, h = 0;
scanf("%lld", &n);
for (int i = 0; i < n; i++) {
scanf("%lld%lld", &y[i].a, &y[i].b);
}
sort(y, y + n, cmp);
for (int i = 0; i <= n; i++) {
h = h + y[i].b;
ans = ans + y[i].a * h;
}
printf("%lld", ans);
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>用户输出
1723325895046Special 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>用户输出
38000700469Special 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>用户输出
2622882053025Special 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>用户输出
2556095436545Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0