Socks(并查集)

Input:
3 2 3
1 2 3
1 2
2 3

Output:
2

#include<bits/stdc++.h>
#define ms(__x__,__val__) memset(__x__, __val__, sizeof(__x__))
#define all(_x_) _x_.begin(),_x_.end()
#define pb(__x__) push_back(__x__)
#define inf 0x3f3f3f3f
#define IOS ios::sync_with_stdio(0);cin.tie(0); cout.tie(0)
using namespace std;
const int maxn = 2e5+5;
int N,M,K;
int fa[maxn];
int color[maxn];
int find(int x){
	return fa[x] == x ? x : fa[x] = find(fa[x]);
}
void merge(int x,int y){
	int Rx = find(x);
	int Ry = find(y);
	fa[Rx] = Ry;
}
int main()
{
	cin>>N>>M>>K;
	for(int i = 1;i <= N;i++) cin>>color[i];
	for(int i = 1;i <= N;i++) fa[i] = i;
	while(M--){
		int L,R;
		cin>>L>>R;
		merge(L,R);
	}
	map<int,map<int,int> > mp;
	for(int i = 1; i <= N;i++){
		int R = find(i);
		mp[R][color[i]]++;
	}
	int ans = 0;
	for(auto u : mp){
		int sum = 0;
		int MAX = 0;
		auto uu = u.second;
		for(auto t : uu){
			sum += t.second;
			MAX = max(MAX,t.second);
		}
		ans += sum - MAX; // 总数量 - 相同数最多的 
	}
	cout<<ans;
}