题目链接:
https://pintia.cn/problem-sets/994805260223102976/problems/994805277163896832
AC代码:
#include<iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cctype>
using namespace std;
const int maxn=1010;
int a[maxn]={0};
int main(){
int N;
scanf("%d",&N);
int num,subnum,score;
for(int i=0;i<N;i++){
scanf("%d-%d%d",&num,&subnum,&score);
a[num]+=score;
}
int max_=0;
for(int i=0;i<maxn;i++){
if(a[i]!=0){
if(a[max_]<a[i]){
max_=i;
}
}
}
printf("%d %d",max_,a[max_]);
return 0;
}
二刷:
#include <iostream>
#include <cstdio>
using namespace std;
const int maxn=1010;
int a[maxn]={0};
int main(){
int n;
cin>>n;
int maxNum=0,max_=0;
while(n--){
int tmpNum,tmp,tmpScr;
scanf("%d-%d %d",&tmpNum,&tmp,&tmpScr);
a[tmpNum]+=tmpScr;
if(a[tmpNum]>max_){
max_=a[tmpNum];
maxNum=tmpNum;
}
}
printf("%d %d",maxNum,max_);
return 0;
}