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>用户输出
1728108704306Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #71719 | #1022. jwp的排队难题 | Wrong Answer | 0 | 127 ms | 2464 K | C++ 11 / 772 B | Rhodoks | 2022-06-29 19:30:00 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define int long long
typedef struct angry {
int a, b;
} Angry;
vector<Angry> p;
Angry temp;
bool cmp(Angry m, Angry n) { return m.a > n.a; }
signed main() {
long long n, sum = 0, t = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> temp.a >> temp.b;
p.push_back(temp);
}
sort(p.begin(), p.end(), cmp);
for (int i = 0; i < n; i++) {
if (p[i].a == p[i + 1].a) {
if (p[i].b > p[i + 1].b) {
temp = p[i + 1];
p[i + 1] = p[i];
p[i] = temp;
}
}
t += p[i].b;
sum += p[i].a * t;
}
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>用户输出
1728108704306Special 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>用户输出
37724131366Special 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>用户输出
2618844997341Special 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>用户输出
2553187955308Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0