백준 소스코드 [C++] 16562 친구비

www.acmicpc.net/problem/16562

16562번: 친구비

백준 소스코드 [C++] 16562 친구비

#include <iostream>
#include <algorithm>
#include <queue>
#include <string.h>
#include <limits.h>
#include <vector>
#include <math.h>
#include <stack>
#include <bitset>
#include <string>
#include <set>
#define all(v) v.begin(), v.end()
#define pii pair<int,int>
#define make_unique(v) v.erase(unique(v.begin(), v.end()), v.end())
typedef long long ll;
using namespace std;

int n, m, k,mini,res=0,sum=0;

bool chk[10000];
int cost[10000];
vector<int> mate[10000];

void search(int i) {
	chk[i] = true;
	sum++;
	mini = min(mini, cost[i]);
	for (int j = 0;j < mate[i].size();j++) {
		if (chk[mate[i][j]] == false) search(mate[i][j]);
	}
	return;
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> m >> k;
	int u, v;
	for (int i = 0;i < n;i++)
		cin >> cost[i];
	for (int i = 0;i < m;i++) {
		cin >> u >> v;
		u--, v--;
		mate[u].push_back(v);
		mate[v].push_back(u);
	}
	for (int i = 0;i < n;i++) {
		if (chk[i] == false) {
			mini = INT_MAX;
			search(i);
			res += mini;
		}
	
	}
	if (sum != n || res>k) cout << "Oh no";
	else cout << res;
	return 0;
}