思路：并查集去做

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6;
int father[maxn];
int Find(int x)
{
	if(father[x]==x)return x;
	return father[x]=Find(father[x]);
}
void Union(int x,int y)
{
	int f1=Find(x),f2=Find(y);
	if(f1!=f2)father[f1]=f2;
}
int main()
{
	int n,m,a[310];
	memset(a,0,sizeof(a));
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		father[i]=i;
	}
	for(int i=1;i<=m;i++)
	{
		int x,y;
		cin>>x>>y;
		Union(x,y);
	}
	for(int i=1;i<=n;i++)
	{
		a[Find(i)]++;
	}
	int cnt=0,maxn=0;
	for(int i=1;i<=n;i++)
	{
		if(a[i]>0)cnt++;
		maxn=max(maxn,a[i]);
	}
	cout<<cnt<<" "<<maxn;
}