AcWing 1142. Busy urban problem solving (minimum spanning tree)

AcWing 1142. A busy city
Kruskal algorithm finds the largest edge in the minimum spanning tree , Record the last edge added to the minimum spanning tree

#include<bits/stdc++.h>

using namespace std;

const int N = 8010;

struct Edge{
    
	int a, b, w;
	bool operator < (const Edge &t) const{
    
		return w < t.w;
	}
}e[N];

int p[N];
int n, m;

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

int main()
{
    
	cin>>n>>m;
	
	for(int i = 1; i <= n; i ++ ) p[i] = i;
	
	for(int i = 0; i < m; i ++ ){
    
		int a, b, c;
		cin>>a>>b>>c;
		e[i] = {
    a, b, c};
	}
	
	sort(e, e + m);
	
	int res = 0;
	for(int i = 0; i < m; i ++ ){
    
		int a = find(e[i].a), b = find(e[i].b), w = e[i].w;
		if(a != b){
    
			p[a] = b;
			res = w;
		}
	}
	
	cout<<n - 1<<' '<<res<<endl;
	return 0; 
}