QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#782594 | #9807. Make Them Believe | caojc# | WA | 0ms | 3624kb | C++20 | 560b | 2024-11-25 20:36:01 | 2024-11-25 20:36:01 |
Judging History
answer
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
void solve() {
vector<pair<string, int>> a(8);
for (int i = 0; i < 8; i++) {
cin >> a[i].fi >> a[i].se;
}
sort(a.begin(), a.end(), [&](auto &x, auto &y){
return x.se > y.se;
});
cout << a[0].fi << " beats " << a[1].fi << "\n";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int tt = 1;
// cin >> tt;
while (tt--) solve();
return 0;
}
/*
g++ 1.cpp -o 1 && ./1 < in.txt > out.txt
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3600kb
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: 3624kb
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: 3508kb
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'