J - Highways

https://vjudge.net/contest/280495#problem/J

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,i,j,k,ff,t,z,l,b[504][504],x1,y1,x,y,v[600],f[600],ans;
int find(int x)
{
    if (f[x]==x) return x;
    return f[x]=find(f[x]);
}
struct str
{
    int x,y,z;
    bool operator<(const str &str1)const
    {
        return z<str1.z;
    }
} a[300000];
int main()
{
    scanf("%d",&t);
    while (t--){
    ans=k=0;
    scanf("%d",&n);
    for (i=1; i<=n; i++)
        f[i]=i;
    for (i=1; i<=n; i++)
        for (j=1; j<=n; j++)
            scanf("%d",&b[i][j]);
    for (i=1; i<=n; i++)
        for (j=1; j<=i; j++)
        {
            k++;
            a[k].x=i;
            a[k].y=j;
            a[k].z=b[i][j];
        }
    sort(a+1,a+1+k);
    for (i=1; i<=k; i++)
    {
        x1=find(a[i].x);
        y1=find(a[i].y);
        if (x1!=y1)
        {
            f[x1]=y1;
            ans=max(ans,a[i].z);
        }
    }
    printf("%d\n",ans);
    }
}