QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#755589 | #9623. 合成大西瓜 | Yori# | WA | 1ms | 5712kb | C++20 | 809b | 2024-11-16 17:43:04 | 2024-11-16 17:43:04 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
typedef long long ll;
typedef pair<int, int> PII;
const int N = 2e5+7;
int n, m, k;
int a[N];
bool vis[N];
vector<int>v[N];
void sovle()
{
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=m;i++){
int x,y;
cin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
int max1=0,min1=2e12;
for(int i=1;i<=n;i++){
if(v[i].size()>=2){
max1=max(max1,a[i]);
}else min1=min(min1,a[i]);
}
cout<<max(max1,min1)<<endl;
}
signed main()
{
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int ING = 1;
//cin>>ING;
while (ING--)
{
sovle();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 5712kb
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: 1ms
memory: 3636kb
input:
5 7 1 5 3 1 4 3 5 1 3 5 1 1 4 5 4 2 4 3 2
output:
2000000000000
result:
wrong answer 1st lines differ - expected: '5', found: '2000000000000'