제출 #886104

#제출 시각아이디문제언어결과실행 시간메모리
886104vjudge1Airplane (NOI23_airplane)C++17
0 / 100
124 ms12128 KiB
#include <bits/stdc++.h> using namespace std; const int INF = INT_MAX; int main(){ int n,m;cin>>n>>m; vector<int> val(n); for (int i = 0; i < n; ++i) { cin>>val[i]; } vector<vector<int>> arr(n); for (int i = 0; i < m; i++){ int u,v;cin>>u>>v; arr[u-1].push_back(v-1); arr[v-1].push_back(u-1); } cout<<max(*max_element(val.begin(),val.end())*2,n-1)<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...