PAT 1034 Head of a Gang 模拟

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
using namespace std;
vector<int>e[2005],v;
int w[2005],vis[2005],nm[2005];
int g[2005][2005];
int cnt,ans,mx,tot,all,id;
string s1,s2;
map<string,int>mp;
string rmp[2005];
void dfs(int u)
{
	if(vis[u])return;
	vis[u] = 1;
	all++;
	tot+=w[u];
	if(w[u]>mx)
	{
		mx = w[u];
		id = u;
	}
	for(int i = 0;i<e[u].size();i++)
	{
		int t = e[u][i];
		dfs(t);
	}
}
bool cmp(int x,int y)
{
	return rmp[x]<rmp[y];
}
int main()
{
	int n,m,i,j,k;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		cnt = ans = 0;
		mp.clear();
		v.clear();
		memset(g,0,sizeof(g));
		memset(vis,0,sizeof(vis));
		for(i = 1;i<=2000;i++)e[i].clear();
		for(i = 1;i<=n;i++)
		{
			cin>>s1>>s2>>k;
			if(mp.find(s1) == mp.end())
			{
			   mp[s1] = ++cnt;
			   rmp[cnt] = s1;	
			}
			if(mp.find(s2) == mp.end())
			{
				mp[s2] = ++cnt;
				rmp[cnt] = s2;
			}
			w[mp[s1]]+=k;
			w[mp[s2]]+=k;
			if(!g[mp[s1]][mp[s2]])
			{
			    e[mp[s1]].push_back(mp[s2]);
				e[mp[s2]].push_back(mp[s1]);
				g[mp[s1]][mp[s2]] = 1;
			}	
		}
		for(i = 1;i<=cnt;i++)
		{
		    if(!vis[i])
			{
				mx = -1,tot = 0,all = 0;
			    dfs(i);	
				if(tot>2*m&&all>2)
				{
				    ans++;	
					v.push_back(id);
					nm[id] = all;	
				}
			}
		}
		cout<<ans<<endl;
		sort(v.begin(),v.end(),cmp);
		for(i = 0;i<v.size();i++)cout<<rmp[v[i]]<<" "<<nm[v[i]]<<endl;
	}
	return 0;
}