QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #739934 | #9623. 合成大西瓜 | suyueovo | WA | 0ms | 3760kb | C++98 | 384b | 2024-11-12 23:58:53 | 2024-11-12 23:59:00 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,m;
int u,v;
signed main()
{
cin>>n>>m;
vector< pair<int,int> > a(n+5);
for(int i=1;i<=n;i++)
{
cin>>a[i].first;
}
for(int i=1;i<=m;i++)
{
cin>>u>>v;
a[u].second++;
a[v].second++;
}
sort(a.begin()+1,a.end());
reverse(a.begin()+1,a.end());
cout<<a[2].first;
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3760kb
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: 3568kb
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'