Submission #74771649

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

//#define int long long
//#define float long double

using uint = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pff = pair<float,float>;
using pdd = pair<ld,ld>;

#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second

const ld PI = 3.14159265358979323846;
const ld E = 2.71828182845904523536;
const int MOD = 998244353;

void solve()
{
    int n,m;
    cin >> n >> m;
    vector<int> r(n+1);
    vector<bool> vis(n+1,false);
    vector<vector<int>> adj(n+1);
    priority_queue<pii> pq;
    for(int i = 1;i <= n;i++)
    {
        cin >> r[i];
        pq.push({r[i],i});
    }
    for(int i = 1;i <= m;i++)
    {
        int u,v;
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    while(!pq.empty())
    {
        pii cur = pq.top();
        pq.pop();
        int p = cur.se;
        if(vis[p])
            continue;
        int partner=n+5;
        for(auto i : adj[p])
        {
            if(!vis[i] && i < partner)
                partner = i;
        }
        vis[p] = true;
        vis[partner] = true;
        if(p == 1 || partner == 1)
        {
            if(p == 1)
                cout << partner << endl;
            else
                cout << p << endl;
            break;
        }
    }
    
}

signed main()
{
    std::cin.tie(nullptr);std::ios::sync_with_stdio(false);
    
    int tt = 1;
    //cin >> tt;
    while(tt--)
    {
        solve();
    }

    return 0;
}

Submission Info

Judge Result