QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#789345 | #9807. Make Them Believe | xuzeqi_noip | WA | 0ms | 3608kb | C++14 | 1.3kb | 2024-11-27 19:58:17 | 2024-11-27 19:58:22 |
Judging History
answer
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
struct LPL {
string name;
int power;
};
// 比较函数,用于std::max_element
bool compareLPL(const LPL& a, const LPL& b) {
return a.power > b.power;
}
int main() {
vector<LPL> players;
int numPlayers = 8; // 假设有8个玩家
string name;
int power;
// 输入玩家信息
for (int i = 0; i < numPlayers; ++i) {
cout << "Enter name and power for player " << i + 1 << ": ";
if (!(cin >> name >> power)) {
cerr << "Invalid input! Exiting program." << endl;
return 1; // 非正常退出
}
players.push_back({name, power});
}
// 找出力量最大的两个玩家
LPL max1 = *max_element(players.begin(), players.end(), compareLPL);
players.erase(remove_if(players.begin(), players.end(), [&](const LPL& p) { return p.power == max1.power; }), players.end());
LPL max2 = *max_element(players.begin(), players.end(), compareLPL);
// 输出结果
if (max1.power > max2.power) {
cout << max1.name << " beats " << max2.name << endl;
} else {
cout << max2.name << " beats " << max1.name << endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3608kb
input:
LNG 55 WBG 65 HLE 70 BLG 75 TES 48 T1 80 GEN 60 FLY 50
output:
Enter name and power for player 1: Enter name and power for player 2: Enter name and power for player 3: Enter name and power for player 4: Enter name and power for player 5: Enter name and power for player 6: Enter name and power for player 7: Enter name and power for player 8: FLY beats TES
result:
wrong answer 1st words differ - expected: 'T1', found: 'Enter'