QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#738355 | #9623. 合成大西瓜 | susanzhishen# | RE | 0ms | 3612kb | C++20 | 949b | 2024-11-12 18:48:24 | 2024-11-12 18:48:37 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
#define double long double
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef long long ll;
typedef pair<int,int> PII;
const int N=3e5+10;
const int M=1e3+10;
int mod=1e9+7;
int a[N];
void solve(){
int n,m;cin>>n>>m;
vector<int>d(n+10);
for(int i=1;i<=n;i++) cin>>a[i];
if(n==1){
cout<<a[1]<<"\n";
return ;
}
vector<int>s;
while(m--){
int x,y;cin>>x>>y;
d[x]++;
d[y]++;
}
int ans=0;
for(int i=1;i<=n;i++){
if(d[i]>=2) ans=max(ans,a[i]);
else{
s.push_back(a[i]);
}
}
sort(s.begin(),s.end());
cout<<max(ans,s[s.size()-2])<<"\n";
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr),cout.tie(nullptr);
int _;
_=1;
// cin>>_;
while(_--){
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
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
Runtime Error
input:
5 7 1 5 3 1 4 3 5 1 3 5 1 1 4 5 4 2 4 3 2