提交时间:2024-11-30 10:56:59
运行 ID: 869
#include <bits/stdc++.h> using namespace std; struct chengji { int biaohao; int fen; }a[1000101]; int main() { int n; cin>>n; int temp[n + 1]; for(int i = 1;i <= n;i++) { cin>>a[i].biaohao>>a[i].fen; temp[i] = 0; } for(int i = 1;i <= n;i++) { temp[a[i].biaohao] += a[i].fen; } int max = 0; int f = 0; for(int i = 1;i <= n;i++) { if(max < temp[i]) { max = temp[i]; f = i; } } cout<<f<<" "<<max; return 0; }