第一个题解（包AC）（无注释）

击败了10000000000000000000000000000000000000.00%的用户
击败了10000000000000000000000000000000000000.00%的用户

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,m;cin >> n >> m;
    long long c[1005][1005];
    while(m--){
        int a,b,x;cin >> a >> b >> x;
        c[a][b] += x;
    }
    long long maxi = -999999;
    int x,y;
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= n;j++){
            long long max1 = maxi;
            maxi = max(maxi,c[i][j]);
            if(maxi != max1)
                x = i,y = j;
        }
    }
    cout << x << " " << y;
    return 0;
}