Submission #3050778

---

Source Code Expand

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

const int N = 1e5 + 10;

int n, m, a[N];
vector<int> g[N];

vector<int> vals;
bool vis[N];
void dfs(int u) {
    if (vis[u]) return;
    vis[u] = 1;
    vals.push_back(a[u]);
    for (auto v : g[u]) dfs(v);
}


int main() {
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> a[i];
    int iter = m; while (iter--) {
        int u,v; cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    if (n-m == 1) return cout << 0, 0;

    bool good = n >= 2*(n-m-1);
    if (!good) return cout << "Impossible\n", 0;

    vector<int> rest;
    int deg = 2*(n-m-1);
    long long ans = 0;
    for (int u = 0; u < n; u++) if (!vis[u]) {
        vals.clear();
        dfs(u);
        sort(vals.begin(), vals.end(), greater<int>());

        ans += vals.back();
        vals.pop_back();
        deg--;
        for (auto x : vals) rest.push_back(x);
    }

    sort(rest.begin(), rest.end(), greater<int>());
    while (deg--) {
        ans += rest.back();
        rest.pop_back();
    }
    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result