QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#757588 | #9623. 合成大西瓜 | Martian148# | WA | 0ms | 3732kb | C++20 | 584b | 2024-11-17 10:56:36 | 2024-11-17 10:56:37 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
// freopen ("E.in", "r", stdin);
int n, m; cin >> n >> m;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)cin >> a[i];
if (n == 1) {
cout << a[1] << '\n';
return 0;
}
int mx1 = 0, mx2 = 0;
for (int i = 1; i <= n; i++) {
if (a[i] >= mx1) {
mx2 = mx1;
mx1 = a[i];
}
else {
if (a[i] >= mx2) {
mx2 = a[i];
}
}
}
cout << mx2 << '\n';
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3732kb
input:
7 9 1 4 1 3 3 6 7 5 4 3 6 3 4 2 3 5 2 2 6 6 7 5 1 4 6
output:
6
result:
ok single line: '6'
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3512kb
input:
5 7 1 5 3 1 4 3 5 1 3 5 1 1 4 5 4 2 4 3 2
output:
4
result:
wrong answer 1st lines differ - expected: '5', found: '4'