QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#799412#9807. Make Them Believexh_team#WA 0ms3844kbC++20458b2024-12-05 13:37:402024-12-05 13:37:41

Judging History

你现在查看的是最新测评结果

  • [2024-12-05 13:37:41]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3844kb
  • [2024-12-05 13:37:40]
  • 提交

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;
}

Details

Tip: Click on the bar to expand more detailed information

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'