AcWing 1252. 搭配购买

AcWing 1252. 搭配购买
并查集+01背包问题
又顺带复习了一下01背包问题

#include<bits/stdc++.h>

using namespace std;

const int N = 1e4 + 10;

int n, m, V;
int v[N], w[N];
int f[N];
int p[N];

int find(int x){
	if(x != p[x]) x = find(p[x]);
	return x;
}

int main()
{
	cin>>n>>m>>V;
	
	for(int i = 1; i <= n; i ++ ) p[i] = i;
	
	for(int i = 1; i <= n; i ++ ){
		cin>>v[i]>>w[i];
	}
	
	for(int i = 1; i <= m; i ++ ){
		int a, b;
		cin>>a>>b;
		int fa = find(a), fb = find(b);
		
		if(fa != fb){
			v[fb] += v[fa];
			w[fb] += w[fa];
			p[fa] = fb;
		}
	}
	
	for(int i = 1; i <= n; i ++ ){
		if(i == p[i]){
			for(int j = V; j >= v[i]; j -- ){
				f[j] = max(f[j], f[j - v[i]] + w[i]);
			}
		}
	}
	
	cout<<f[V]<<endl;
	
	return 0;
}