QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #785770 | #9807. Make Them Believe | CodyLee# | WA | 0ms | 3824kb | C++17 | 310b | 2024-11-26 19:08:29 | 2024-11-26 19:08:29 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
struct node {
string s;
int num;
}a[200];
bool cmp(node x, node y) {
return x.num > y.num;
}
int main()
{
for(int i = 1; i <= 8; i ++) {
cin >> a[i].s >> a[i].num;
}
sort(a + 1, a + 8 + 1, cmp);
cout << a[1].s << " beats " << a[2].s;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3824kb
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: 3600kb
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: 3796kb
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'