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>用户输出
1719107993437
Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #103970 | #1022. jwp的排队难题 | Wrong Answer | 0 | 103 ms | 1780 K | C++ 17 / 863 B | Sakura丶Charon | 2024-05-13 18:16:38 |
#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define debug(x) cerr << #x " = " << x << '\n';
using namespace std;
void solve() {
int n;
cin >> n;
using pii = pair<int, int>;
vector<pii> a(n);
for (int i = 0; i < n; i++) cin >> a[i].x >> a[i].y;
auto cmp = [](pii A, pii B) {
if (A.y == B.y)
return A.x < B.y;
return A.y > B.y;
};
sort(a.begin(), a.end(), cmp);
int ans = 0, cnt = 0;
for (int i = 0; i < n; i++) {
cnt += a[i].x;
ans += cnt * a[i].y;
}
cout << ans << '\n';
}
signed main() {
// freopen("Sample.in", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T = 1;
// cin >> T;
while (T--) solve();
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>用户输出
1719107993437
Special 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>用户输出
37905733706
Special 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>用户输出
2616248095829
Special 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>用户输出
2549684865955
Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0