flag41 编程团体赛成绩

最新推荐文章于 2022-04-23 21:42:29 发布

a__white

最新推荐文章于 2022-04-23 21:42:29 发布

阅读量140

点赞数

本文链接：https://blog.csdn.net/a__white/article/details/79433863

版权

# include <stdio.h>
# include <malloc.h>
typedef struct stu
{
int duiwuid;
int id;
int score;
}Node,*Pnode;
void max(int *a);
void main()
{
int T1=6,i;
int c[1001]={0};
//scanf("%d",&T1);
Pnode base=(Pnode)malloc(sizeof(Node)*T1);
base[0].duiwuid=3;
base[0].id=10;
base[0].score=99;
base[1].duiwuid=11;
base[1].id=5;
base[1].score=87;
base[2].duiwuid=102;
base[2].id=1;
base[2].score=0;
base[3].duiwuid=102;
base[3].id=3;
base[3].score=100;
base[4].duiwuid=11;
base[4].id=9;
base[4].score=89;
base[5].duiwuid=3;
base[5].id=2;
base[5].score=61;
//for(i=0;i<T1;i++)
//scanf("%d-%d-%d",&base[i].duiwuid,&base[i].id,&base[i].score);
for(i=0;i<T1;i++)
c[base[i].duiwuid]+=base[i].score;
max(c);
}
void max(int *a)
{
int i,max=-1,maxi=-1;
for(i=0;i<1001;i++)
{
if(a[i]>max)
{
max=a[i];
maxi=i;
}
}
printf("%d %d",maxi,max);
}