QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #784252 | #9807. Make Them Believe | Qzong# | WA | 0ms | 3692kb | C++14 | 333b | 2024-11-26 14:18:07 | 2024-11-26 14:18:10 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
struct node{
string a;
int b;
bool operator<(const node&A)const {
return b>A.b;
}
}a[8];
int main(){
// freopen("a.in","r",stdin);
for(int i=0;i<8;i++)cin>>a[i].a>>a[i].b;
sort(a,a+8);
cout<<a[0].a<<" beats "<<a[1].a;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3640kb
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: 3628kb
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: 3692kb
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'