| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 886099 | vjudge1 | Toxic Gene (NOI23_toxic) | C++17 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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<<n-1+*max_element(val.begin(), val.end())<<endl;
}
