玄学60pts

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5;
vector<int> Next[N];
int n , m , minn , maxn;
bitset<N> vis , C;//0蓝1红 
queue<int> Q; 
void bfs(const int &s){
	vis[s] = 1;
	Q.push(1);
	C[s] = 1;
	int blue = 1, red = 0;
	while(!Q.empty()){
		int t = Q.front();
		for(auto i : Next[t]){
			if(vis[i] == 0){
				vis[i] = 1;
				Q.push(i);
				if(C[t] == 0){
					red ++;
					C[i] = 1;
				}else{
					blue ++;
					C[i] = 0;
				}
			}
		}
		Q.pop();
	}
	minn += min(red , blue);
	maxn += max(red , blue);
}
signed main(){
	cin >> n >> m;
	for(int i = 1;i <= m;i ++){
		int x , y;
		cin >> x >> y;
		Next[x].push_back(y);
		Next[y].push_back(x);
	}
	for(int i = 1;i <= n;i ++){
		if(vis[i] == 0){
			bfs(i);
		}
	}
//	for(int i = 1;i <= n;i ++){
//		cout << C[i] << ' ';
//	}
	cout << minn << ' ' << maxn;
	return 0;
}