QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#799412 | #9807. Make Them Believe | xh_team# | WA | 0ms | 3844kb | C++20 | 458b | 2024-12-05 13:37:40 | 2024-12-05 13:37:41 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n = 8;
vector<pair<int, string>> a(n);
for (auto &[x, y] : a) {
cin >> y >> x;
}
vector<int> c(8);
iota(c.begin(), c.end(), 0);
sort(c.begin(), c.end(), [&](int x, int y) {
return a[x].first > a[y].first;
});
cout << a[c[0]].second << " beats " << a[c[1]].second;
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3644kb
input:
LNG 55 WBG 65 HLE 70 BLG 75 TES 48 T1 80 GEN 60 FLY 50
output:
T1 beats BLG
result:
ok 3 tokens
Test #2:
score: 0
Accepted
time: 0ms
memory: 3844kb
input:
LNG 55 WBG 65 HLE 70 BLG 81 TES 48 T1 80 GEN 60 FLY 50
output:
BLG beats T1
result:
ok 3 tokens
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3576kb
input:
P6 73 4 22 UN 84 Q 55 J 68 QR8 18 W 27 9J7 1
output:
UN beats P6
result:
wrong answer 3rd words differ - expected: 'J', found: 'P6'