QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #790454 | #9807. Make Them Believe | hanmx | WA | 1ms | 3628kb | C++17 | 449b | 2024-11-28 12:17:55 | 2024-11-28 12:17:56 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using i64=long long;
using u64=unsigned long long;
void solve(){
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
vector<pair<int,string>> a(8);
for(int i=0;i<8;i++){
cin>>a[i].second>>a[i].first;
}
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
cout<<a[0].second<<" beats "<<a[1].second;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3624kb
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: 1ms
memory: 3560kb
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: 1ms
memory: 3628kb
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'