PTA1032-C语言-挖掘机技术哪家强

#include <stdio.h>

typedef struct info_team
{
    int school;
    int grade;
}InfoTeam;

int main()
{
    int N;
    int i;
    scanf("%d",&N);
  
    InfoTeam all[N];
    int gradetotal[100001] = {0};//测试点三
    int schooltotal = 0;

    for(i = 0; i < N ; i ++)
    {
        scanf("%d%d",&all[i].school,&all[i].grade);
        gradetotal[all[i].school] += all[i].grade;
        if(all[i].school >= schooltotal)
        {
            schooltotal = all[i].school;
        }  
    }
    int max_school = 0;
    int max_grade = 0;
    for(i = 1; i <= schooltotal; i ++)
    {
        if(gradetotal[i] >= max_grade)
        {
            max_grade = gradetotal[i];
            max_school= i;
        }
    }

    printf("%d %d",max_school,max_grade);
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值