id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
6,500 | int main(){
int n,i,j,temp;
cin>>n;
struct stu{
int xuehao[100000];
int yuwen[100000];
int shuxue[100000];
int zongfen[100000];
}a;
for(i=0;i<n;i++)
{
cin>>a.xuehao[i];
cin>>a.yuwen[i];
cin>>a.shuxue[i];
a.zongfen[i]=a.shuxue[i]+a.yuwen[i];
}
for(i=n-1;i>=n-3;i--)
for(j=i;j>=1;j--)
if(a.zongfen[j]>a.zongfen[j-1])
{
temp=a.zongfen[j-1];
a.zongfen[j-1]=a.zongfen[j];
a.zongfen[j]=temp;
temp=a.xuehao[j-1];
a.xuehao[j-1]=a.xuehao[j];
a.xuehao[j]=temp;
}
for(i=0;i<=2;i++)
cout<<a.xuehao[i]<<" "<<a.zongfen[i]<<endl;
return 0;
}
| 14 |
6,501 | struct stu
{
int a;
int b;
int c;
int d;
struct stu *next;
};
int n;
struct stu *creat(void)
{
struct stu *head,*p1,*p2;
int i=1;
head=NULL;
p2=p1=(struct stu *)malloc(LEN);
scanf("%d%d%d",&p1->a,&p1->b,&p1->c);
p1->d=p1->b+p1->c;
while(1)
{
if(i==1)
head=p1;
else
p2->next=p1;
p2=p1;
if(i>=n) break;
p1=(struct stu *)malloc(LEN);
scanf("%d%d%d",&p1->a,&p1->b,&p1->c);
p1->d=p1->b+p1->c;
i++;
}
p2->next=NULL;
return(head);
}
void main()
{
struct stu *z,*p3,*p[100007],*q;
int i=0,j,m;
scanf("%d",&n);
z=creat();
p3=p[i]=z;
while(p3!=NULL)
{
i++;
p[i]=p3->next;
p3=p[i];
}
m=i;
q=p[0];
for(i=0;i<4;i++)
{
for(j=0;j<m-1-i;j++)
{
if(p[j]->d>=p[j+1]->d)
{
q=p[j];
p[j]=p[j+1];
p[j+1]=q;
}
}
}
for(i=1;i<4;i++)
{
printf("%d %d\n",p[m-i]->a,p[m-i]->d);
}
} | 14 |
6,502 | struct stud
{ int n;
int m;
int c;
int t;
}s[100000],temp;
void main()
{
int i,j,k,n,p;
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%d %d %d",&s[i].n,&s[i].m,&s[i].c);
s[i].t=s[i].m+s[i].c;
}
for(j=0;j<3&&j<n;j++)
{ for(k=j+1,p=j;k<n;k++)
if(s[p].t<s[k].t){p=k;}
temp=s[j];s[j]=s[p];s[p]=temp;
printf("%d %d\n",s[j].n,s[j].t);
}
} | 14 |
6,503 | struct student{
int ID;
int yw;
int sx;
} stu[100000];//??????
int main(){
int num,i,j,sum[100000],t,m;
cin>>num;
for(i=1;i<=num;i++){
cin>>stu[i].ID>>stu[i].yw>>stu[i].sx;
sum[i]=stu[i].yw+stu[i].sx;
}//?????????
for(i=1;i<4;i++){
for(j=num;j>1;j--){
if(sum[j]>sum[j-1]){
t=sum[j-1];m=stu[j-1].ID;
sum[j-1]=sum[j];stu[j-1].ID=stu[j].ID;
sum[j]=t;stu[j].ID=m;
}
}
}//????
for(i=1;i<4;i++){
cout<<stu[i].ID<<' '<<sum[i]<<endl;}
return 0;
}//????
| 14 |
6,504 |
struct student
{
int num;
int chi;
int math;
};
int main()
{
int n,i,e=0,f=0,g=0,a=0,b=0,c=0;
scanf("%d",&n);
struct student*stu=(struct student*)malloc(sizeof(int)*3*n);
int*sz=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].chi,&stu[i].math);
sz[i]=stu[i].chi+stu[i].math;
}
for(i=0;i<n;i++)
{
if(sz[i]>sz[a])
{
a=i;
e=stu[i].num;
}
}
printf("%d %d\n",e,sz[a]);
for(i=0;i<n;i++)
{
if(i==a)
{
continue;
}
if(sz[i]>sz[b])
{
b=i;
f=stu[i].num;
}
}
printf("%d %d\n",f,sz[b]);
for(i=0;i<n;i++)
{
if(i==a||i==b)
{
continue;
}
if(sz[i]>sz[c])
{
c=i;
g=stu[i].num;
}
}
printf("%d %d",g,sz[c]);
free(sz);
return 0;
} | 14 |
6,505 | void main()
{
struct student
{int num;
int score1;
int score2;
}stu[100000];
long int n;
int i,score[100000],max[3]={0},a[3];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[i].num,&stu[i].score1,&stu[i].score2);
score[i]=stu[i].score1+stu[i].score2;
}
for(i=0;i<n;i++)
{
if(max[0]<score[i]){max[0]=score[i];a[0]=stu[i].num;}
}
for(i=0;i<n;i++)
{if(stu[i].num==a[0])continue;
else if(max[1]<score[i]){max[1]=score[i];a[1]=stu[i].num;}
}
for(i=0;i<n;i++)
{if(stu[i].num==a[1]||stu[i].num==a[0])continue;
else if(max[2]<score[i]){max[2]=score[i];a[2]=stu[i].num;}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",a[i],max[i]);
}
} | 14 |
6,506 |
struct student
{
int num,chi,mat,tot;
}stu[100000];
int main()
{
void max(struct student [],int n);
int n,i,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[i].num,&stu[i].chi,&stu[i].mat);
stu[i].tot=stu[i].chi+stu[i].mat;
}
for(k=0;k<3;k++)
{
max(stu,n);
if(k<2)
printf("\n");
}
}
void max(struct student stu[],int n)
{
int i,j,max;
max=stu[0].tot;
for(i=0;i<n;i++)
if(stu[i].tot>max)
{
max=stu[i].tot;
j=i;
}
printf("%d %d",stu[j].num,max);
stu[j].tot=-1;
}
| 14 |
6,507 | int main()
{
int n,i,j;
float one=0,two=0,three=0,yi=0,er=0,san=0;
float a[100000][2];
scanf("%d",&n);
struct Student
{
float xuehao;
float yuwen;
float shuxue;
} student;
for (i=0;i<n;i++){
scanf("%f %f %f",&student.xuehao,&student.yuwen,&student.shuxue);
for (j=0;j<2;j++){
a[i][1]=student.yuwen+student.shuxue;
a[i][0]=i+1;
}
}
for (i=0;i<n;i++){
if (a[i][1]>one)
{ one=a[i][1];
yi=a[i][0]; }
}
for (i=0;i<n;i++){
if (a[i][1]>two&&a[i][1]<=one&&a[i][0]!=yi)
{ two=a[i][1];
er=a[i][0]; }
}
for (i=0;i<n;i++){
if (a[i][1]>three&&a[i][1]<=one&&a[i][1]<=two&&a[i][0]!=yi&&a[i][0]!=er)
{ three=a[i][1];
san=a[i][0]; }
}
printf("%.0f %.0f\n",yi,one);
printf("%.0f %.0f\n",er,two);
printf("%.0f %.0f\n",san,three);
return 0;
}
| 14 |
6,508 | struct student
{
int ID;
int Chinese;
int Math;
int Score;
};
main()
{
int n,i,first=0,ifirst,second=0,isecond,third=0,ithird;
scanf("%d",&n);
struct student STUDENT_NUM[n];
for(i=0;i<n;i++)
{
scanf("%d %d %d",&STUDENT_NUM[i].ID,&STUDENT_NUM[i].Chinese,&STUDENT_NUM[i].Math);
STUDENT_NUM[i].Score=STUDENT_NUM[i].Chinese+STUDENT_NUM[i].Math;
}
for(i=0;i<n;i++)
{
if(first<STUDENT_NUM[i].Score)
{
first=STUDENT_NUM[i].Score;
ifirst=i;
}
}
for(i=0;i<n;i++)
{
if(second<STUDENT_NUM[i].Score&&STUDENT_NUM[i].Score<=first&&i!=ifirst)
{
second=STUDENT_NUM[i].Score;
isecond=i;
}
}
for(i=0;i<n;i++)
{
if(third<STUDENT_NUM[i].Score&&STUDENT_NUM[i].Score<=second&&i!=ifirst&&i!=isecond)
{
third=STUDENT_NUM[i].Score;
ithird=i;
}
}
printf("%d %d\n",STUDENT_NUM[ifirst].ID,first);
printf("%d %d\n",STUDENT_NUM[isecond].ID,second);
printf("%d %d\n",STUDENT_NUM[ithird].ID,third);
}
| 14 |
6,509 | struct stu
{
int num;
int chinese;
int maths;
}stu[100000];
void main()
{
int i,j,n,sum[100000],max=0,m;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d\n",&stu[i].num,&stu[i].chinese,&stu[i].maths);
}
for(i=0;i<n;i++)
{
sum[i]=stu[i].chinese+stu[i].maths;
}
for(j=0;j<3;j++)
{
for(i=0;i<n;i++)
{
if(sum[i]>max)
{max=sum[i];
m=i;}
}
printf("%d %d\n",stu[m].num,sum[m]);
sum[m]=0;
max=0;
}
} | 14 |
6,510 | struct student
{
int num;
int chinese;
int maths;
int sum;};
int main()
{ struct student stu[4]={0,0,0,0};
struct student temp[4]={0,0,0,0};
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[3].num,&stu[3].chinese,&stu[3].maths);
stu[3].sum=stu[3].chinese+stu[3].maths;
//printf("%d",stu[3].chinese);
if(stu[3].sum>stu[0].sum)
{stu[2]=stu[1];stu[1]=stu[0];stu[0]=stu[3];}
else if(stu[3].sum>stu[1].sum)
{stu[2]=stu[1];stu[1]=stu[3];}
else if(stu[3].sum>stu[2].sum)
{stu[2]=stu[3];}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",stu[i].num,stu[i].sum);
}
return 0;
} | 14 |
6,511 |
struct student
{long num;
int math;
int chinese;
int sum;
struct student *next;
};
long n;
struct student *creat(void)
{struct student *head;
struct student *p1,*p2;
int i=1;
scanf("%ld",&n);
p1=p2=(struct student*)malloc(LEN);
scanf("%ld%d%d",&p1->num,&p1->math,&p1->chinese);
p2->sum=p2->chinese+p2->math;
while (i<=n)
{
if(i==1) head=p1;
else
{p1=(struct student*)malloc(LEN);
scanf("%ld%d%d",&p1->num,&p1->math,&p1->chinese);
p1->sum=p1->chinese+p1->math;
p2->next=p1;
p2=p1;}
i++;
}
p2->next=0;
return head;
}
struct student *del(struct student *head,int max)
{
struct student *p1,*p2;
p1=head;
while (p1->sum!=max&&p1->next!=0)
{
p2=p1;p1=p1->next;
}
if(p1->sum==max)
{
if(p1==head) head=p1->next;
else p2->next=p1->next;
n=n-1;
}
return(head);
}
void print(struct student *head)
{
struct student *p1,*p2;
int i,max,num;
max=head->sum;
p1=head;
p2=p1->next;
for(i=1;i<=3;i++)
{
while(p1->next!=0)
{
if((p2->sum)>max) {max=p2->sum; num=p2->num;}
p1=p2;
p2=p1->next;
}
printf("%ld %d\n",num,max);
head=del(head,max);
p1=head;
p2=p1->next;
max=p1->sum;
}
}
//void print (struct student*head)
//{
// struct student *p;
// p=head;
// if(head!=0)
// do
// {
// printf("%ld %d %d %d\n",p->num,p->math,p->chinese,p->sum);
// p=p->next;
// }while (p!=0);
//}
main()
{
struct student *head;
head=creat();
print(head);
} | 14 |
6,512 | void main()
{
struct student
{
int num;
int yu;
int shu;
int c;
} s[100000],k;
int i,j,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&s[i].num,&s[i].yu,&s[i].shu);
s[i].c=s[i].yu+s[i].shu;
}
/* for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(s[j].c<s[j+1].c)
{
k=s[j];
s[j]=s[j+1];
s[j+1]=k;
}
}
}
for(i=0;i<3;i++)
printf("%d %d\n",s[i].num,s[i].c);*/
for(i=0;i<3;i++)
{
for(j=i+1;j<n-1;j++)
if(s[j].c>s[i].c)
{
k=s[i];
s[i]=s[j];
s[j]=k;
}
printf("%d %d\n",s[i].num,s[i].c);
}
} | 14 |
6,513 | /* Note:Your choice is C IDE */
void main()
{
struct student
{
int a;
int b;
int c;
int d;
int h;
}s[100000];
int i,j,k,n,max;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&s[i].a,&s[i].b,&s[i].c);
s[i].d=s[i].b+s[i].c;
s[i].h=-1;
}
for(i=1;i<=3;i++)
{
max=0;
k=0;
for(j=1;j<=n;j++)
{
if((s[j].d>max)&&(s[j].h==-1))
{
max=s[j].d;
k=j;
}
}
s[k].h=1;
printf("%d %d\n",s[k].a,s[k].d);
}
} | 14 |
6,514 | struct student
{
char num[10];
int yuwen;
int shuxue;
int sum;
};
int main()
{
int n,i;
scanf("%d",&n);
struct student a[100000];
struct student s[3];
struct student k;
for(i=0;i<n;i++)
{
scanf("%s %d %d",a[i].num,&a[i].yuwen,&a[i].shuxue);
a[i].sum=a[i].yuwen+a[i].shuxue;
}
s[0]=a[0];
s[1]=a[0];
s[1].sum=0;
s[2]=a[0];
s[2].sum=0;
for(i=1;i<n;i++)
{
if(a[i].sum>s[2].sum&&a[i].sum<=s[1].sum){s[2]=a[i];}
if(a[i].sum>s[1].sum&&a[i].sum<=s[0].sum){s[2]=s[1];s[1]=a[i];}
if(a[i].sum>s[0].sum) {s[2]=s[1];s[1]=s[0];s[0]=a[i];}
}
for(i=0;i<3;i++)
{
printf("%s %d\n",s[i].num,s[i].sum);
}
getchar();getchar();
}
| 14 |
6,515 | struct student
{
int num;
int chi;
int math;
int sum;
};
void main()
{
int n,i,j,max;
struct student t,*s;
scanf("%d",&n);
s=(struct student *)malloc(n*sizeof(struct student));
for(i=0;i<n;i++)
{ scanf("%d%d%d",&s[i].num,&s[i].chi,&s[i].math);
s[i].sum=s[i].chi+s[i].math;}
max=0;
for(i=0;i<n;i++)
{
if (max<s[i].sum) {max=s[i].sum;j=i;}
}
printf("%d %d\n",s[j].num,s[j].sum);
s[j].sum=0; max=0;
for(i=0;i<n;i++)
{
if (max<s[i].sum) {max=s[i].sum;j=i;}
}
printf("%d %d\n",s[j].num,s[j].sum);
s[j].sum=0; max=0;
for(i=0;i<n;i++)
{
if (max<s[i].sum) {max=s[i].sum;j=i;}
}
printf("%d %d\n",s[j].num,s[j].sum);
s[j].sum=0;
} | 14 |
6,516 | int main()
{
int n,i,j,q,w;
scanf("%d",&n);
int a[n],b[n],c[n],d[n];
for(i=0;i<n;i++)
{scanf("%d %d %d",&a[i],&b[i],&c[i]);
}
for(i=0;i<n;i++)
{ d[i]=b[i]+c[i];
}
for(i=0;i<3;i++)
{ for(j=i+1;j<n;j++)
{ if(d[i]<d[j])
{q=d[i];
d[i]=d[j];
d[j]=q;
w=a[i];
a[i]=a[j];
a[j]=w;}
}
}
for(i=0;i<3;i++)
{ printf("%d %d\n",a[i],d[i]);
}
getchar();
getchar();
getchar();
getchar();
getchar();
}
| 14 |
6,517 | struct stu{
int a;
int b;
int c;
struct stu *next;
};
void main()
{
int n,i,j,max;
struct stu *head,*p1,*p2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
if(i==0)
{
head=p1=p2=(struct stu*)malloc(sizeof(struct stu));
scanf("%d %d %d",&p1->a,&p1->b,&p1->c);
head=p1;
p2=p1;
}
else
{
p1=(struct stu*)malloc(sizeof(struct stu));
scanf("%d %d %d",&p1->a,&p1->b,&p1->c);
p2->next=p1;
p2=p1;
}
}
p2->next=NULL;
for(j=0;j<3;j++)
{
max=0;
p1=head;
for(i=0;p1->next!=NULL;i++)
{
if(p1->b+p1->c>max)max=p1->b+p1->c;
p1=p1->next;
}
p1=head;
for(i=0;p1->next!=NULL;i++)
{
if(p1->b+p1->c==max)
{
printf("%d %d\n",p1->a,max);
p1->b=0;
p1->c=0;
p1=p1->next;
break;
}
else p1=p1->next;
}
}
}
| 14 |
6,518 | struct student
{
int num;
float chinese;
float math;
float sum;
};
void main()
{
int n,i;
struct student *pt,*p,temp;
scanf("%d",&n);
pt=(struct student *)malloc(n*LEN);
for(p=pt;p<pt+n;p++)
{
scanf("%d%f%f",&p->num,&p->chinese,&p->math);
p->sum=p->chinese+p->math;
}
for(i=0;i<3;i++)
{
for(p=pt;p<pt+n-1-i;p++)
{
if(p->sum>=(p+1)->sum)
{temp=*p;*p=*(p+1);*(p+1)=temp;}
}
}
for(p=pt+n-1;p>pt+n-4;p--)
{
printf("%d %g\n",p->num,p->sum);
}
} | 14 |
6,519 | int main()
{
struct student
{
int ID;
int yuwen;
int shuxue;
int zongfen;
};
struct student student[100000];
int n,i,max,maxID;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d %d %d",&student[i].ID,&student[i].yuwen,&student[i].shuxue);
for(i=1;i<=n;i++)
student[i].zongfen=student[i].yuwen+student[i].shuxue;
for(int j=1;j<=3;j++)
{
maxID=1;
max=student[1].zongfen;
for(i=2;i<=n;i++)
if(student[i].zongfen>max)
{
maxID=student[i].ID;
max=student[i].zongfen;
}
printf("%d %d\n",maxID,max);
student[maxID].zongfen=0;
}
} | 14 |
6,520 | struct score
{
int ID;
int chinese;
int math;
};
void main()
{
int n,i,*sum,max,p=0;
//struct score s[100000];
struct score *s;
scanf("%d",&n);
s=(struct score *)malloc(sizeof(struct score)*n);
sum=(int *)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
scanf("%d%d%d",&s[i].ID,&s[i].chinese,&s[i].math);
for(i=0;i<n;i++) *(sum+i)=s[i].chinese+s[i].math;
max=sum[0];
for(i=0;i<n;i++)
{
if(max<*(sum+i)) {max=*(sum+i);p=i;}
}
printf("%d %d\n",s[p].ID,*(sum+p));
if(n>1)
{
max=*sum;*(sum+p)=0;p=0;
for(i=0;i<n;i++)
{
if(max<*(sum+i)) {max=*(sum+i);p=i;}
}
printf("%d %d\n",s[p].ID,*(sum+p));
if(n>2)
{
max=*sum;*(sum+p)=0;p=0;
for(i=0;i<n;i++)
{
if(max<*(sum+i)) {max=*(sum+i);p=i;}
}
printf("%d %d\n",s[p].ID,*(sum+p));
}
}
} | 14 |
6,521 | struct xue
{
int ID;
int sx;
int yw;
int sum;
}xueshen;
int main()
{
int n,i,k;
scanf("%d",&n);
struct xue *xuesheng;
xuesheng=(struct xue*)malloc(4*sizeof(int)*n);
for (i=0;i<n;i++){
scanf("%d%d%d",&xuesheng[i].ID,&xuesheng[i].sx,&xuesheng[i].yw);
xuesheng[i].sum=xuesheng[i].sx+xuesheng[i].yw;
}
for (i=1;i<4;i++){
for(k=0;k<n-i;k++){
if(xuesheng[k].sum>=xuesheng[k+1].sum){
xueshen=xuesheng[k+1];
xuesheng[k+1]=xuesheng[k];
xuesheng[k]=xueshen;
}
}
}
for (i=1;i<4;i++){
printf("%d %d\n",xuesheng[n-i].ID,xuesheng[n-i].sum);
}
return 0;
}
| 14 |
6,522 | struct student
{int math;
int chi;
int num;
int sum;
};
void main()
{
int i,j,k,n,t,m;
struct student stu[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d",&stu[i].num,&stu[i].math,&stu[i].chi);
for(i=0;i<n;i++)
stu[i].sum=stu[i].math+stu[i].chi;
for(i=0;i<3;i++)
{for(j=i+1,k=i;j<n;j++)
{
if(stu[j].sum>stu[k].sum)
k=j;
}
t=stu[i].sum;stu[i].sum=stu[k].sum;stu[k].sum=t;
m=stu[i].num;stu[i].num=stu[k].num;stu[k].num=m;
}
for(i=0;i<3;i++)
printf("%d %d\n",stu[i].num,stu[i].sum);
} | 14 |
6,523 | struct student{
int num;
int chinese;
int math;
};
int main()
{
int n,i;
scanf("%d",&n);
struct student a[100000],e ;
for(i=0;i<n;i++){
scanf("%d %d %d",&a[i].num,&a[i].chinese,&a[i].math);
}
for(i=0;i<n-1;i++){
if(a[i].chinese+a[i].math>=a[i+1].chinese+a[i+1].math){
e=a[i];
a[i]=a[i+1];
a[i+1]=e;
}
}
for(i=0;i<n-2;i++){
if(a[i].chinese+a[i].math>=a[i+1].chinese+a[i+1].math){
e=a[i];
a[i]=a[i+1];
a[i+1]=e;
}
}
for(i=0;i<n-3;i++){
if(a[i].chinese+a[i].math>=a[i+1].chinese+a[i+1].math){
e=a[i];
a[i]=a[i+1];
a[i+1]=e;
}
}
for(i=n-1;i>n-4;i--){
printf("%d %d\n",a[i].num,a[i].chinese+a[i].math);
}
return 0;
}
| 14 |
6,524 | void main()
{
struct student
{
int num,sum;
} stu[100000];
int n,i,j,k,a,b,t;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&a,&b);
stu[i].sum=a+b;
}
for (i=0;i<3;i++)
for (j=n-i-1;j>0;j--)
if (stu[j].sum>stu[j-1].sum)
{
t=stu[j].sum;stu[j].sum=stu[j-1].sum;stu[j-1].sum=t;
t=stu[j].num;stu[j].num=stu[j-1].num;stu[j-1].num=t;
}
for (i=0;i<3;i++) printf("%d %d\n",stu[i].num,stu[i].sum);
} | 14 |
6,525 | struct stud
{
int n;
int chinese;
int math;
int total;
struct stud *next;
};
int tol;
struct stud *creat(void)
{
struct stud *head,*p1,*p2;
int i=1;
p1=p2=(struct stud *)malloc(sizeof(struct stud));
head=p1;
for(i=1;i<tol;i++)
{
scanf("%d%d%d",&p1->n,&p1->chinese,&p1->math);
p1->total=(p1->math+p1->chinese);
p1=(struct stud *)malloc(sizeof(struct stud));
p2->next=p1;
p2=p1;
}
scanf("%d%d%d",&p1->n,&p1->chinese,&p1->math);
p1->total=(p1->math+p1->chinese);
p2->next=p1;
p1->next=0;
return head;//???????
}
int max(struct stud *head,int max1,int max2)
{
struct stud *p1;
int maxtotal=head->total,max_index;
for(p1=head;p1!=0;p1=p1->next)
{
if(p1->total>maxtotal&&p1->n!=max1&&p1->n!=max2)
{
maxtotal=(p1->total);
max_index=(p1->n);
}
}
if(maxtotal!=max1)
printf("%d %d\n",max_index,maxtotal);
return max_index;
}
void main()
{
struct stud *head;
int max1,max2;
scanf("%d",&tol);
head=creat();
max1=max(head,0,0);
max2=max(head,max1,0);
max(head,max1,max2);
}
| 14 |
6,526 |
struct student{
int a;
int b;
int c;//?????????????
};
int main(int argc, char* argv[])
{
int n,i,j,temp,temp2,sum=0;
int max1,max2,max3,id1,id2,id3;
scanf("%d",&n);
struct student*s=(struct student*)malloc(n*sizeof(struct student));
int*end=(int*)malloc(n*sizeof(int));//??????????????????????
for(i=0;i<n;i++){
scanf("%d %d %d",&s[i].a,&s[i].b,&s[i].c);
end[i]=s[i].b+s[i].c;
}
max1=-100;max2=-100;max3=-100;
id1=s[0].a; id2=s[0].a; id3=s[0].a;
for(i=0;i<n;i++)
if(end[i]>max1){
max1=end[i];
id1=s[i].a;
}//?????
for(i=0;i<n;i++)
if(end[i]!=max1&&end[i]>max2){
max2=end[i];
id2=s[i].a;
}//?????
for(i=0;i<n;i++)
if(end[i]!=max1&&end[i]!=max2&&end[i]>max3){
max3=end[i];
id3=s[i].a;
}//???????(????????????????????????????????)
for(i=0;i<n;i++){
if(end[i]==max1){
printf("%d %d\n",s[i].a,max1);
sum++;
}
}
for(i=0;i<n;i++){
if(sum<=2&&end[i]==max2){
printf("%d %d\n",s[i].a,max2);
sum++;
}
}
for(i=0;i<n;i++){
if(sum<=2&&end[i]==max3){
printf("%d %d\n",s[i].a,max3);
}
}//???????????????????????
free(s);
free(end);
return 0;
}
| 14 |
6,527 | main()
{
int n,i;
struct student
{
int num;
int yuwen;
int shuxue;
int zongfen;
}
stu[100000];
struct qiansan
{
int num;
int zongfen;
}st[3]={{0,0},{0,0},{0,0}};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&stu[i].num);
scanf("%d",&stu[i].yuwen);
scanf("%d",&stu[i].shuxue);
stu[i].zongfen=stu[i].yuwen+stu[i].shuxue;
if(stu[i].zongfen>st[0].zongfen)
{
st[2]=st[1];
st[1]=st[0];
st[0].zongfen=stu[i].zongfen;
st[0].num=stu[i].num;
}
else if(stu[i].zongfen<=st[0].zongfen&&stu[i].zongfen>st[1].zongfen)
{
st[2]=st[1];
st[1].zongfen=stu[i].zongfen;
st[1].num=stu[i].num;
}
else if(stu[i].zongfen<=st[1].zongfen&&stu[i].zongfen>st[2].zongfen)
{
st[2].zongfen=stu[i].zongfen;
st[2].num=stu[i].num;
}
}
for(i=0;i<3;i++)
{
if(i==0)
printf("%d %d",st[i].num,st[i].zongfen);
else
printf("\n%d %d",st[i].num,st[i].zongfen);
}
getchar();
getchar();
}
| 14 |
6,528 |
struct statistics
{
int num;
int chinese;
int math;
int sum;
} form[100000],temp;
int main()
{
int n;
scanf("%d",&n);
int i,j;
for(i=0;i<n;i++)
{
scanf("%d %d %d",&form[i].num,&form[i].chinese,&form[i].math);
form[i].sum=form[i].chinese+form[i].math;
}
for(i=0;i<3;i++)
{
int k=i;
for(j=i+1;j<n;j++)
{
if(form[j].sum>form[k].sum)
{
k=j;
}
}
if (k!=i)
{
temp=form[i];
form[i]=form[k];
form[k]=temp;
}
}
for(i=0;i<3;i++)
printf("%d %d\n",form[i].num,form[i].sum);
return 0;
} | 14 |
6,529 |
struct Student
{
int num,yuwen,shuxue,sum;
};
void main()
{
int n,max1=0,max2=0,max3=0,stu1=0,stu2=0,stu3=0;
struct Student student[100000],*stu;
scanf("%d",&n);
for(stu=student;stu<student+n;stu++){
scanf("%d",&stu->num);
scanf("%d",&stu->yuwen);
scanf("%d",&stu->shuxue);
(stu->sum)=(stu->yuwen)+(stu->shuxue);
if(stu->sum>=max3){
if(stu->sum>=max2){
if(stu->sum>=max1){
if(stu->sum>max1){
max3=max2;
max2=max1;
max1=stu->sum;
stu3=stu2;
stu2=stu1;
stu1=stu->num;
}
else{
max3=max2;
max2=max1;
max1=stu->sum;
stu3=stu2;
stu2=stu->num;
}
}
else{
if(stu->sum>max2){
max3=max2;
max2=stu->sum;
stu3=stu2;
stu2=stu->num;
}
else{
max3=max2;
max2=stu->sum;
stu3=stu->num;
}
}
}
else{
if(stu->sum>max3){
max3=stu->sum;
stu3=stu->num;
}
else max3=stu->sum;
}
}
}
stu=student;
printf("%d %d\n",(stu+stu1-1)->num,(stu+stu1-1)->sum);
printf("%d %d\n",(stu+stu2-1)->num,(stu+stu2-1)->sum);
printf("%d %d\n",(stu+stu3-1)->num,(stu+stu3-1)->sum);
} | 14 |
6,530 | int main()
{
int n;
scanf ("%d",&n);
struct student
{
int num;
int chinese;
int maths;
};
struct student a[100000],temp;
int i;
for (i=0;i<n;i++)
{
scanf("%d",&a[i].num);
scanf("%d",&a[i].chinese);
scanf("%d",&a[i].maths);
}
for (i=1;i<n;i++)
{
if ((a[i].chinese+a[i].maths)>(a[0].chinese+a[0].maths))
{
temp=a[0];
a[0]=a[i];
a[i]=temp;
}
}
printf("%d %d\n",a[0].num,a[0].chinese+a[0].maths);
for (i=2;i<n;i++)
{
if ((a[i].chinese+a[i].maths)>(a[1].chinese+a[1].maths))
{
temp=a[1];
a[1]=a[i];
a[i]=temp;
}
}
printf("%d %d\n",a[1].num,a[1].chinese+a[1].maths);
for (i=3;i<n;i++)
{
if ((a[i].chinese+a[i].maths)>(a[2].chinese+a[2].maths))
{
temp=a[2];
a[2]=a[i];
a[i]=temp;
}
}
printf("%d %d\n",a[2].num,a[2].chinese+a[2].maths);
return 0;
}
| 14 |
6,531 |
struct stu
{
int num;
int ch;
int mt;
int sum;
struct stu*next;
};
void main()
{
struct stu *p1,*p2,*p,*head;
int n,max=0,max2=0,max3=0,no=0,no2=0,no3=0;
scanf("%d",&n);
p1=(struct stu*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->ch,&p1->mt);
p1->sum=p1->ch+p1->mt;
head=p1;
p2=p1;
while(n-1)
{
p1=(struct stu*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->ch,&p1->mt);
p1->sum=p1->ch+p1->mt;
p2->next=p1;
p2=p1;
//printf("%d %d %d\n",p1->num,p1->ch,p1->mt,p1->sum);
n--;
}
p2->next=NULL;
p=head;
while(p)
{
if(p->sum>max)
{
max=p->sum;
no=p->num;
}
p=p->next;
}
printf("%d %d\n",no,max);
p=head;
while(p)
{
if(p->sum>max2&&p->sum<=max&&p->num!=no)
{
max2=p->sum;
no2=p->num;
}
p=p->next;
}
printf("%d %d\n",no2,max2);
p=head;
while(p)
{
if(p->sum>max3&&p->sum<=max2&&p->num!=no2&&p->num!=no)
{
max3=p->sum;
no3=p->num;
}
p=p->next;
}
printf("%d %d\n",no3,max3);
} | 14 |
6,532 |
int main()
{
int n,i,score[100000],max1=0,m1=0,max2=0,m2=0,max3=0,m3=0;
scanf("%d",&n);
struct stu{
int No;
int yw;
int math;
}s[100000];
for(i=0;i<n;i++){
scanf("%d%d%d",&s[i].No,&s[i].yw,&s[i].math),
score[i]=s[i].yw+s[i].math;
if(score[i]>max1){
max3=max2;
max2=max1;
max1=score[i];
m3=m2;
m2=m1;
m1=i;
continue;
}
if(score[i]<=max1&&score[i]>max2){
max3=max2;
max2=score[i];
m3=m2;
m2=i;
continue;
}
if(score[i]<=max2&&score[i]>max3){
max3=score[i];
m3=i;
continue;
}
}
printf("%d %d\n%d %d\n%d %d\n",s[m1].No,max1,s[m2].No,max2,s[m3].No,max3);
return 0;
} | 14 |
6,533 |
int main()
{
long n,i;
int high[4]={0};
long higher[4];
struct student
{
long num;
int yuwen;
int shuxue;
int total;
}stu[100000];
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].yuwen,&stu[i].shuxue);
stu[i].total=stu[i].yuwen+stu[i].shuxue;
if (stu[i].total>high[1])
{
high[1]=stu[i].total;
higher[1]=i;
}
}
for (i=1;i<=n;i++)
if (stu[i].total<=high[1]&&stu[i].total>high[2]&&i!=higher[1])
{
high[2]=stu[i].total;
higher[2]=i;
}
for (i=1;i<=n;i++)
if (stu[i].total<=high[2]&&stu[i].total>high[3]&&i!=higher[1]&&i!=higher[2])
{
high[3]=stu[i].total;
higher[3]=i;
}
for (i=1;i<4;i++)
printf("%d %d\n",higher[i],high[i]);
} | 14 |
6,534 |
int main()
{
int n,i,j,k;
struct student
{
int num;
int chi;
int math;
int sum;
}score[100000],temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&score[i].num,&score[i].chi,&score[i].math);
score[i].sum=score[i].chi + score[i].math;
}
for(i=0;i<4;i++)
{
k=i;
for(j=i+1;j<n;j++)
if(score[j].sum>score[k].sum) k=j;
temp=score[k];score[k]=score[i];score[i]=temp;
}
printf("%d %d",score[0].num,score[0].sum);printf("\n");
printf("%d %d",score[1].num,score[1].sum);printf("\n");
printf("%d %d",score[2].num,score[2].sum);
return 0;
} | 14 |
6,535 |
int main()
{
struct student
{
int num, ch, ma, grade;
}sum[100000], h, m, t;
int i, n;
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%d%d%d", &sum[i].num, &sum[i].ch, &sum[i].ma);
sum[i].grade=sum[i].ch+sum[i].ma;
}
h.grade=m.grade=t.grade=0;
for(i=0;i<n;i++)
{
if(sum[i].grade>h.grade)
{
t=m;
m=h;
h=sum[i];
}
else if(sum[i].grade>m.grade)
{
t=m;
m=sum[i];
}
else if(sum[i].grade>t.grade)
t=sum[i];
}
printf("%d %d\n%d %d\n%d %d\n", h.num, h.grade, m.num, m.grade, t.num, t.grade);
return 0;
}
| 14 |
6,536 | struct stud {
int id;
float langrade;
float mathgrade;
} student[100000],s;
int student_num;
float total[100000],t;
void trisort(){
for(int i=0;i<2;i++)
for(int j=0;j<2-i;j++)
if(total[j]<total[j+1]){
t=total[j];
s=student[j];
total[j]=total[j+1];
student[j]=student[j+1];
total[j+1]=t;
student[j+1]=s;
}
}
int main(){
int i,j;
cin>>student_num;
for(i=0;i<student_num;i++){
cin>>student[i].id>>student[i].langrade>>student[i].mathgrade;
total[i]=student[i].langrade+student[i].mathgrade;}
for(j=3;j<student_num;j++)
{trisort();
if(total[j]>total[2]){
t=total[2];
s=student[2];
total[2]=total[j];
student[2]=student[j];
total[j]=t;
student[j]=s;
}
}
for(i=0;i<3;i++)
cout<<student[i].id<<" "<<total[i]<<endl;
return 0;
}
| 14 |
6,537 |
struct Student
{
int number;
int math;
int chinese;
int total;
struct Student *next;
};
void main()
{
int i=0,n,max;
struct Student *linkHead, *linkTail, *student,*ppre,*pmax,*premax;
scanf("%d",&n);
linkHead = linkTail = NULL;
//????????????
while(i<n)
{
student = (struct Student *)malloc(Len);
scanf("%d %d %d",&student->number, &student->math, &student->chinese);
student->total=student->math+student->chinese;
student->next = NULL;
if (linkTail == NULL)
//????????????
linkHead = linkTail = student;
else
{
//?????????????????????
linkTail->next = student;
linkTail = student;
}
i++;
}
i=0;
while(i<3)
{
student=linkHead;
ppre=student;
max=0;
pmax=linkHead;
premax=linkHead;
while(student != NULL )
{
if(student->total>max)
{
max=student->total;
pmax=student;
premax=ppre;
}
ppre=student;
student=student->next;
}
printf("%d %d\n", pmax->number, pmax->total);
if(pmax==linkHead) //????????????
linkHead=student->next;
else premax->next=pmax->next; //???i??????????????i?????????????????????????????????????????flag?????????????????
i++;
}
} | 14 |
6,538 | struct student
{
int num;
int chi;
int mat;
int sum;
}stu[100000];
void main()
{
int i,n,max=0,m,k;
scanf("%d",&n);
for(i=0;i<n;i++) {scanf("%d %d %d",&stu[i].num,&stu[i].chi,&stu[i].mat);stu[i].sum=stu[i].chi+stu[i].mat;}
for(k=0;k<3;k++)
{
for(i=0;i<n;i++) if(stu[i].sum>max) {max=stu[i].sum;m=i;}
printf("%d %d\n",stu[m].num,stu[m].sum);
stu[m].sum=0;
max=0;
}
}
| 14 |
6,539 | int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
struct student{
int a,b,c;
}student_1;
int x,i=0;
int a1=0,a2=0,b1=0,b2=0,c1=0,c2=0;
while(i<n){
scanf("%d%d%d",&student_1.a,&student_1.b,&student_1.c);
x=student_1.b+student_1.c;
if(x>a2){
c1=b1;
c2=b2;
b1=a1;
b2=a2;
a1=student_1.a;
a2=x;
}
else if(x==a2){
if (x > b2)
{
c1 = b1;
c2 = b2;
b1=student_1.a;
b2=x;
}
else if (x > c2)
{
c1 = student_1.a;
c2 = x;
}
}
else if(x>b2){
c1=b1;
c2=b2;
b1=student_1.a;
b2=x;
}
else if(x==b2){
if (x > c2)
{
c1=student_1.a;
c2=x;
}
}
else if(x>c2){
c1=student_1.a;
c2=x;
}
i++;
}
printf("%d %d\n",a1,a2);
printf("%d %d\n",b1,b2);
printf("%d %d\n",c1,c2);
return 0;
} | 14 |
6,540 |
struct student
{
int ID;
int yuwen;
int shuxue;
int zongfen;
};
int main()
{
int n,i,j,e;
scanf("%d",&n);
struct student*stu=(struct student*)malloc(sizeof(struct student)*n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].ID,&stu[i].yuwen,&stu[i].shuxue);
stu[i].zongfen=stu[i].yuwen+stu[i].shuxue;
}
for(i=1;i<4;i++)
{
for(j=0;j<n-i;j++)
{
if(stu[j].zongfen>=stu[j+1].zongfen)
{
e=stu[j].zongfen;
stu[j].zongfen=stu[j+1].zongfen;
stu[j+1].zongfen=e;
e=stu[j].ID;
stu[j].ID=stu[j+1].ID;
stu[j+1].ID=e;
}
}
}
printf("%d %d\n%d %d\n%d %d\n",stu[n-1].ID,stu[n-1].zongfen,stu[n-2].ID,stu[n-2].zongfen,stu[n-3].ID,stu[n-3].zongfen);
return 0;
}
| 14 |
6,541 | struct s
{long int a;
int b;
int c;
int sum;
struct s *next;};
void main()
{struct s *head1,*head2;
struct s *p,*p1,*p2,*p3,*p4;
long int n,i;
int rank1,rank2,rank3;
scanf("%ld",&n);
p1=(struct s *)malloc(L);
scanf("%ld %d %d",&p1->a,&p1->b,&p1->c);
p1->sum=p1->b+p1->c;
rank1=p1->sum;
for(i=1;;i++)
{if(i==1) head1=p1;
else p2->next=p1;
p2=p1;
if(i==n) break;
p1=(struct s *)malloc(L);
scanf("%ld %d %d",&p1->a,&p1->b,&p1->c);
p1->sum=p1->b+p1->c;
if(p1->sum>rank1) rank1=p1->sum;}
p2->next=N;
p1=head1;
while(rank1!=p1->sum)
{p2=p1;p1=p1->next;}
if(rank1==p1->sum)
{if(p1==head1) head1=p1->next;
else p2->next=p1->next;
p3=p1;}
head2=p3;
p4=p3;
p1=head1;
rank2=p1->sum;
while(p1!=N)
{if(p1->sum>rank2) rank2=p1->sum;
p1=p1->next;}
p1=head1;
while(rank2!=p1->sum)
{p2=p1;p1=p1->next;}
if(rank2==p1->sum)
{if(p1==head1) head1=p1->next;
else p2->next=p1->next;
p3=p1;}
p4->next=p3;
p4=p3;
p1=head1;
rank3=p1->sum;
while(p1!=N)
{if(p1->sum>rank3) rank3=p1->sum;
p1=p1->next;}
p1=head1;
while(rank3!=p1->sum)
{p2=p1;p1=p1->next;}
if(rank3==p1->sum)
{if(p1==head1) head1=p1->next;
else p2->next=p1->next;
p3=p1;}
p4->next=p3;
p3->next=N;
p=head2;
do{printf("%ld %d\n",p->a,p->sum);
p=p->next;}while(p!=N);
}
| 14 |
6,542 | struct student
{
int num;
int score1;
int score2;
int sum;
struct student *next;
};
struct student *creat(int m)
{
int i=0;
struct student *head,*p1,*p2;
p1=p2=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->score1,&p1->score2);
p1->sum=(p1->score1)+(p1->score2);
head=NULL;
for(i=0;i<m-1;i++)
{
if(i==0) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->score1,&p1->score2);
p1->sum=(p1->score1)+(p1->score2);
}
p2->next=p1;
p1->next=NULL;
return(head);
}
void print(struct student *head)
{
struct student *p=head,*q=head;
int a=0,b=0,c=0;
if(head!=NULL)
{do
{
if(a<p->sum)
{a=p->sum;q=p;}
p=p->next;
}while(p!=NULL);
printf("%d %d\n",q->num,q->sum);
q->sum=0;
p=head;q=head;
do
{if(b<p->sum)
{b=p->sum;q=p;}
p=p->next;
}while(p!=NULL);
printf("%d %d\n",q->num,q->sum);
q->sum=0;
p=head;q=head;
do
{if(c<p->sum)
{c=p->sum;q=p;}
p=p->next;
}while(p!=NULL);
printf("%d %d",q->num,q->sum);
}
}
void main()
{
int m;
scanf("%d",&m);
struct student *head,stu;
head=creat(m);
print(head);
} | 14 |
6,543 | int main()
{
struct stu
{
int num;
int ch;
int ma;
int to;
};
int i,j1,j2,j3,k,max;
struct stu student[100000]={0};
struct stu temp;
scanf("%d",&k);
for(i=0;i<=k-1;i++)
{
scanf("%d%d%d",&student[i].num,&student[i].ch,&student[i].ma);
student[i].to=student[i].ch+student[i].ma;
}
max=0;
for(i=0;i<=k-1;i++)
{
if(student[i].to>max)
{
max=student[i].to;
j1=i;
}
}
printf("%d ",student[j1].num);
printf("%d\n",student[j1].to);
max=0;
for(i=0;i<=k-1;i++)
{
if(i==j1) continue;
if(student[i].to>max)
{
max=student[i].to;
j2=i;
}
}
printf("%d ",student[j2].num);
printf("%d\n",student[j2].to);max=0;
max=0;
for(i=0;i<=k-1;i++)
{
if(i==j1||i==j2) continue;
if(student[i].to>max)
{
max=student[i].to;
j3=i;
}
}
printf("%d ",student[j3].num);
printf("%d\n",student[j3].to);
return 0;
} | 14 |
6,544 |
int main()
{
struct stu
{
int yu;
int shu;
char name[6];
};
struct stu s[100000],one,two,three;
one.yu=0;one.shu=0;
two.yu=0;two.shu=0;
three.yu=0;three.shu=0;
int n,j,k;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%s %d %d",s[j].name,&s[j].yu,&s[j].shu);
}
for(j=0;j<n;j++)
{
if((s[j].yu+s[j].shu)>(one.yu+one.shu))
{
one=s[j];
k=j;
}
}
s[k].yu=0;s[k].shu=0;
for(j=0;j<n;j++)
{
if((s[j].yu+s[j].shu)>(two.yu+two.shu))
{
two=s[j];
k=j;
}
}
s[k].yu=0;s[k].shu=0;
for(j=0;j<n;j++)
{
if((s[j].yu+s[j].shu)>(three.yu+three.shu))
three=s[j];
}
printf("%s %d\n%s %d\n%s %d\n",one.name,one.yu+one.shu,two.name,two.yu+two.shu,three.name,three.yu+three.shu);
return 0;
} | 14 |
6,545 | struct student
{
int num;
int chi;
int math;
struct student *next;
};
struct student *creat(int n)
{
struct student *head,*p1,*p2;
int i;
p1=p2=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->chi,&p1->math);
head=p1;
for(i=2;i<=n;i++)
{
p1=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->chi,&p1->math);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return head;
}
void main()
{
struct student *head,*p,*p1,*p2,*p3;
int n,m1,m2,m3,k;
scanf("%d",&n);
head=creat(n);
p=head;
m1=m2=m3=0;
if(head!=NULL)
{
do
{
k=p->chi+p->math;
if(k>m1)
{ m1=k;p1=p;}
p=p->next;
}
while(p!=NULL);
p=head;
do
{
k=p->chi+p->math;
if((k>m2)&&(p!=p1))
{ m2=k;p2=p;}
p=p->next;
}
while(p!=NULL);
p=head;
do
{
k=p->chi+p->math;
if((k>m3)&&(p!=p1)&&(p!=p2))
{ m3=k;p3=p;}
p=p->next;
}
while(p!=NULL);
}
printf("%d %d\n%d %d\n%d %d\n",p1->num,m1,p2->num,m2,p3->num,m3);
} | 14 |
6,546 | void main()
{
long n;
scanf("%ld",&n);
struct student
{
int num;
int chi;
int math;
int sum;
}stu[100000];
int i;
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].chi,&stu[i].math);
stu[i].sum=stu[i].chi+stu[i].math;
}
struct student blank;
for(i=0;i<n;i++)
{
if(stu[i].sum>stu[0].sum)
{
blank=stu[0];
stu[0]=stu[i];
stu[i]=blank;
}
}
for(i=1;i<n;i++)
{
if(stu[i].sum>stu[1].sum)
{
blank=stu[1];
stu[1]=stu[i];
stu[i]=blank;
}
}
for(i=2;i<n;i++)
{
if(stu[i].sum>stu[2].sum)
{
blank=stu[2];
stu[2]=stu[i];
stu[i]=blank;
}
}
for(i=0;i<=2;i++)
printf("%d %d\n",stu[i].num,stu[i].sum);
}
| 14 |
6,547 | void main()
{
struct student
{
int a;int math;int chi;int sum;struct student*next;
};
int n,i;int max;
struct student *p1,*p2,*head;
scanf("%d",&n);
head=NULL;
for(i=0;i<n;i++)
{
if(i==0) head=p1=(struct student*)malloc(LEN);
else {
p1->next=(struct student*)malloc(LEN);p1=p1->next;
}
scanf("%d%d%d",&p1->a,&p1->math,&p1->chi);
p1->sum=(p1->math)+(p1->chi);
}
p1->next=NULL;
for(i=0;i<3;i++)
{
p1=head;max=p1->sum;
do
{p1=p1->next;
if(p1->sum>max) {max=p1->sum;p2=p1;}
}while(p1->next!=NULL);
printf("%d %d\n",p2->a,p2->sum);
p2->sum=0;
}
}
| 14 |
6,548 | struct
{
int x;
int y;
int s;
int z;
}a[100010],t;
int main()
{
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].s);
a[i].z=a[i].y+a[i].s;
}
for(i=0;i<=2;i++)
for(j=n-1;j>=i;j--)
{
if(a[j+1].z>a[j].z)
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
printf("%d %d\n",a[0].x,a[0].z);
printf("%d %d\n",a[1].x,a[1].z);
printf("%d %d\n",a[2].x,a[2].z);
return 0;
}
| 14 |
6,549 | struct student
{
int ID;
int chi;
int math;
}student[100000];
int main()
{
int n,i,j,k;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
{
scanf("%d %d %d",&student[i].ID,&student[i].chi,&student[i].math);
a[i]=student[i].chi+student[i].math;
}
for(k=0;k<3;k++)
{
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(a[i]<a[j])
break;
}
if(j==n&&a[i]>=a[j-1])
{
printf("%d %d\n",student[i].ID,a[i]);
a[i]=0;
break;
}
}
}
getchar();
getchar();
}
| 14 |
6,550 | void main()
{
struct student{
int i;
int x;
int y;
int m;
struct student *next;
};
int n,j,k;
struct student *head,*p1,*p2,*p0;
scanf("%d",&n);
p1=(struct student*) malloc(LEN);
scanf("%d%d%d",&p1->i,&p1->x,&p1->y);
p1->m=p1->x+p1->y;
p2=(struct student*) malloc(LEN);
scanf("%d%d%d",&p2->i,&p2->x,&p2->y);
p2->m=p2->x+p2->y;
if(p1->m>p2->m)
{head=p1;p1->next=p2;p2->next=0;}
else{p0=p1;p1=p2;p2=p0;head=p1;p1->next=p2;p2->next=0;}
p0=(struct student*) malloc(LEN);
scanf("%d%d%d",&p0->i,&p0->x,&p0->y);
p0->m=p0->x+p0->y;
while((p0->m<=p1->m)&&(p1->next!=0))
{
p2=p1;p1=p1->next;
}
if(p0->m>p1->m)
{
if(head==p1) head=p0;else p2->next=p0;
p0->next=p1;
}
else
{
p1->next=p0;p0->next=0;
}
for(j=3;j<n;j++)
{
p0=(struct student*) malloc(LEN);
scanf("%d%d%d",&p0->i,&p0->x,&p0->y);
p0->m=p0->x+p0->y;
for(k=0,p1=head;k<=2;k++)
{if(p0->m>p1->m) break; p1=p1->next;}
if (k==3) continue;
p1=p2=head;
while(p0->m<=p1->m)
{
p2=p1;p1=p1->next;
}
if(p0->m>p1->m)
{
if(head==p1) head=p0;else p2->next=p0;
p0->next=p1;
}
else
{
p1->next=p0;p0->next=0;
}
}
for(p1=head,j=0;j<3;j++)
{
printf("%d %d\n",p1->i,p1->m);
p1=p1->next;
}
}
| 14 |
6,551 | struct student
{
int id,word,math,sum;
}stu[100000];
void main()
{
int n,i=1,maxi;
scanf("%d",&n);
while(i<=n)
{
scanf("%d %d %d",&stu[i].id,&stu[i].word,&stu[i].math);
stu[i].sum=stu[i].word+stu[i].math;
i=i+1;
}
i=n;
stu[n+1].sum=0;
stu[n+2].sum=0;
stu[n+3].sum=0;
stu[n+1].id=0;
stu[n+2].id=0;
stu[n+3].id=0;
stu[n+1].math=0;
stu[n+2].math=0;
stu[n+3].math=0;
stu[n+1].word=0;
stu[n+2].word=0;
stu[n+3].word=0;
while(i>=1)
{
if(stu[i].sum>=stu[n+1].sum)
{ stu[n+1]=stu[i];
maxi=i;
}
i=i-1;
}
printf("%d %d\n",stu[n+1].id,stu[n+1].sum);
stu[maxi].sum=0;
i=n;
while(i>=1)
{
if(stu[i].sum>=stu[n+2].sum)
{ stu[n+2]=stu[i];
maxi=i;
}
i=i-1;
}
printf("%d %d\n",stu[n+2].id,stu[n+2].sum);
stu[maxi].sum=0;
i=n;
while(i>=1)
{
if(stu[i].sum>=stu[n+3].sum)
stu[n+3]=stu[i];
i=i-1;
}
printf("%d %d\n",stu[n+3].id,stu[n+3].sum);
}
| 14 |
6,552 | struct stu
{
int num;
int ch;
int math;
struct stu* next;
};
void main()
{
int n,m=0,max=0,max2=0,max3=0,no=0,no2=0,no3=0;
struct stu*p;
scanf("%d",&n);
struct stu*p1,*p2,*head;
p1=(struct stu*)malloc(LEN);
scanf("%d%d%d",&p1->num,&p1->ch,&p1->math);
head=NULL;
while(n-1)
{
m=m+1;
if(m==1)
head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct stu*)malloc(LEN);
scanf("%d%d%d",&p1->num,&p1->ch,&p1->math);
n--;
}
p2->next=NULL;
p=head;
while(p)
{
p->ch=p->math+p->ch;
p=p->next;
}
p=head;
while(p)
{
if(p->ch>max)
{
max=p->ch;
no=p->num;
}
p=p->next;
}
printf("%d %d\n",no,max);
p=head;
while(p)
{
if(p->ch<=max&&p->ch>max2&&p->num!=no)
{
max2=p->ch;
no2=p->num;
}
p=p->next;
}
printf("%d %d\n",no2,max2);
p=head;
while(p)
{
if(p->ch<=max2&&p->ch>max3&&p->num!=no&&p->num!=no2)
{
max3=p->ch;
no3=p->num;
}
p=p->next;
}
printf("%d %d",no3,max3);
} | 14 |
6,553 | struct student
{
int num;
int liter;
int math;
int total;
};
int main()
{
int i,j,k,n;
struct student a[100000],n1,n2,n3;
scanf("%d",&n);
scanf("%d%d%d",&a[0].num,&a[0].liter,&a[0].math);
a[0].total=a[0].liter+a[0].math;
n1=n2=n3=a[0];
for(i=1;i<n;i++)
{
scanf("%d%d%d",&a[i].num,&a[i].liter,&a[i].math);
a[i].total=a[i].liter+a[i].math;
if(a[i].total>n1.total)
{
n3=n2;
n2=n1;
n1=a[i];
}
else if(a[i].total>n2.total)
{
n3=n2;
n2=a[i];
}
else if(a[i].total>n3.total)
n3=a[i];
}
printf("%d %d\n",n1.num,n1.total);
printf("%d %d\n",n2.num,n2.total);
printf("%d %d",n3.num,n3.total);
return 0;
} | 14 |
6,554 | struct student{ int num;int a;int b;int c;};
void main()
{
int n,i,j,m,t;
struct student stu[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d %d %d",&stu[i].num,&stu[i].a,&stu[i].b);
stu[i].c=stu[i].a+stu[i].b;}
for(i=0;i<3;i++)
for(j=i+1;j<n;j++)
{
if(stu[i].c<stu[j].c){
t=stu[i].c;stu[i].c=stu[j].c;stu[j].c=t;
m=stu[i].num;stu[i].num=stu[j].num;stu[j].num=m;}
}
for(i=0;i<3;i++)
printf("%d %d\n",stu[i].num,stu[i].c);
} | 14 |
6,555 |
struct student
{
int num;
int yuwen;
int shuxue;
struct student *next;
};
int n;
struct student *creat(int m)
{
struct student *head;
struct student *p1,*p2;
n=0;
p1=p2=(struct student*)malloc(LEN);
scanf("%d%d%d",&p1->num,&p1->yuwen,&p1->shuxue);
head=NULL;
while(m--)
{
n=n+1;
if(n==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%d%d%d",&p1->num,&p1->yuwen,&p1->shuxue);
}
p2->next=NULL;
return(head);
}
struct student *del(struct student *head,int num)
{
struct student *p1,*p2;
p1=head;
while(num!=p1->num&&p1->next!=NULL)
{
p2=p1;
p1=p1->next;
}
if(num==p1->num)
{
if(p1==head)head=p1->next;
else p2->next=p1->next;
n=n-1;
}
return(head);
}
void main()
{
struct student *head,*p1,*p2;
int max=0,i,m;
scanf("%d",&m);
printf("\n");
head=creat(m);
for(i=0;i<3;i++)
{
p1=p2=head;
max=0;
while(p1->next!=NULL)
{
if((p1->yuwen+p1->shuxue)>max)
max=p1->yuwen+p1->shuxue,p2=p1;
p1=p1->next;
}
printf("%d %d\n",p2->num,(p2->yuwen+p2->shuxue));
head=del(head,p2->num);
}
}
| 14 |
6,556 | /*
* structure_1.cpp
*
* Created on: 2010-12-29
* Author: ???
* ??? ????????
*/
int main(){
int n,i,j;
cin>>n;
struct student{ //?????????????????????
int id;
int cp;
int mp;
int tp;
} stu[n],temp;
for(i=0;i<n;i++){ //??????
cin>>stu[i].id>>stu[i].cp>>stu[i].mp;
stu[i].tp=stu[i].cp+stu[i].mp;
}
for(i=0;i<3;i++) //?????????
for(j=n-1;j>i;j--)
if(stu[j].tp>stu[j-1].tp){
temp=stu[j];
stu[j]=stu[j-1];
stu[j-1]=temp;
}
for(i=0;i<3;i++) //???????
cout<<stu[i].id<<' '<<stu[i].tp<<endl;
return 0;
}
| 14 |
6,557 | void main()
{
struct student
{
char a[6];
int c;
int m;
int s;
struct student * next;
};
struct student * head;
struct student * p1,* p2;
struct student first={"",0,0,0,0};
struct student second={"",0,0,0,0};
struct student third={"",0,0,0,0};
int n,i,j;
char ch;
scanf("%d",&n);
p1=p2=(struct student * )malloc(LEN);
for(j=0;j<6;j=j+1)
p1->a[j]='\0';
getchar();
for(j=0;(ch=getchar())!=' ';j=j+1)
p1->a[j]=ch;
scanf("%d%d",&p1->c,&p1->m);
p1->s=p1->c+p1->m;
head=0;
for(i=1;i<n;i=i+1)
{
if(i==1)
head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student * )malloc(LEN);
for(j=0;j<6;j=j+1)
p1->a[j]='\0';
getchar();
for(j=0;(ch=getchar())!=' ';j=j+1)
p1->a[j]=ch;
scanf("%d%d",&p1->c,&p1->m);
p1->s=p1->c+p1->m;
}
p2->next=0;
for(p1=head;p1!=0;p1=p1->next)
{
if(p1->s>first.s)
{
third=second;
second=first;
first=* p1;
}
else if(p1->s>second.s)
{
third=second;
second=* p1;
}
else if(p1->s>third.s)
{
third=* p1;
}
else
continue;
}
printf("%s %d\n",first.a,first.s);
printf("%s %d\n",second.a,second.s);
printf("%s %d\n",third.a,third.s);
} | 14 |
6,558 | int main()
{
struct {
int ID;
int ch,math;
int sum;
}a[100000];
int n,m1,m2,m3,x,y,z;
scanf("%d",&n);
scanf("%d %d %d",&a[0].ID,&a[0].ch,&a[0].math);
m1=a[0].ch+a[0].math;
int i;
for(i=0;i<n;i++)
{
scanf("%d %d %d",&a[i].ID,&a[i].ch,&a[i].math);
a[i].sum=a[i].ch+a[i].math;
if(a[i].sum>m1)
{
m1=a[i].sum;
x=i;
}
}
printf("%d %d\n",a[x].ID,m1);
a[x].ch=a[x].math=a[x].sum=0;
int j;
scanf("%d %d %d",&a[0].ID,&a[0].ch,&a[0].math);
m2=a[0].sum;
for(j=0;j<n;j++)
{
scanf("%d %d %d",&a[j].ID,&a[j].ch,&a[j].math);
a[j].sum=a[j].ch+a[j].math;
if(a[j].sum>m2)
{
m2=a[j].sum;
y=j;
}
}
printf("%d %d\n",a[y].ID,m2);
a[y].ch=a[y].math=a[y].sum=0;
int k;
scanf("%d %d %d",&a[0].ID,&a[0].ch,&a[0].math);
m3=a[0].sum;
for(k=0;k<n;k++)
{
scanf("%d %d %d",&a[k].ID,&a[k].ch,&a[k].math);
a[k].sum=a[k].ch+a[k].math;
if(a[k].sum>m3)
{
m3=a[k].sum;
z=k;
}
}
printf("%d %d\n",a[z].ID,m3);
return 0;
}
| 14 |
6,559 | main()
{
int i,n,t[3]={0},u[3]={0};
struct student
{
long int ID;
int math;
int chinese;
int a;
}stu[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].ID,&stu[i].math,&stu[i].chinese);
stu[i].a=stu[i].math+stu[i].chinese;
}
for(i=0;i<n;i++)
{
if(stu[i].a>t[0])
{t[0]=stu[i].a;u[0]=i;}
}
for(i=0;i<n;i++)
{
if(i==u[0])continue;
if(stu[i].a>t[1])
{t[1]=stu[i].a;u[1]=i;}
}
for(i=0;i<n;i++)
{
if(i==u[0]||i==u[1])continue;
if(stu[i].a>t[2])
{t[2]=stu[i].a;u[2]=i;}
}
printf("%d %d\n%d %d\n%d %d\n",stu[u[0]].ID,t[0],stu[u[1]].ID,t[1],stu[u[2]].ID,t[2]);
} | 14 |
6,560 | int main()
{
int n,i,j,b,c,d,t,z;
struct a
{
int num;
int b;
int c;
int d;
}a[4];
scanf("%d",&n);
for(i=0;i<3;i++){
scanf("%d %d %d",&a[i].num,&a[i].b,&a[i].c);
a[i].d=a[i].b+a[i].c;
}
for(j=0;j<2;j++){
for(i=0;i<2-j;i++){
if(a[i].d<a[i+1].d){
t=a[i].d;
z=a[i].num;
a[i].d=a[i+1].d;
a[i].num=a[i+1].num;
a[i+1].d=t;
a[i+1].num=z;
}
}
}
for(i=3;i<n;i++){
scanf("%d %d %d",&a[3].num,&a[3].b,&a[3].c);
a[3].d=a[3].b+a[3].c;
if(a[3].d>a[0].d){
a[2]=a[1];
a[1]=a[0];
a[0]=a[3];
}
else if(a[3].d>a[1].d){
a[2]=a[1];
a[1]=a[3];
}
else if(a[3].d>a[2].d){
a[2]=a[3];
}
}
printf("%d %d\n",a[0].num,a[0].d);
printf("%d %d\n",a[1].num,a[1].d);
printf("%d %d\n",a[2].num,a[2].d);
return 0;
}
| 14 |
6,561 | struct student
{
long number;
int chinese;
int math;
int sum;
struct student *next;
struct student *last;
};
struct student *creat(int n)
{
struct student *head,*p1,*p2;
int i;
p1=(struct student *)malloc(len);
scanf("%d %d %d",&p1->number,&p1->chinese,&p1->math);
p1->sum=p1->chinese+p1->math;
p1->last=null;p1->next=null;
head=p1;p2=p1;
for(i=2;i<=n;i++)
{
p1=(struct student *)malloc(len);
scanf("%d %d %d",&p1->number,&p1->chinese,&p1->math);
p1->sum=p1->chinese+p1->math;
p1->last=p2;
p2->next=p1;
p1->next=null;
p2=p1;
}
return(head);
}
struct student *print(struct student *head)
{
struct student *max,*p;
p=head;max=head;
while(p)
{
if(p->sum>max->sum)max=p;
p=p->next;
}
printf("%d %d\n",max->number,max->sum);
if(max==head)
{
max->next->last=null;
head=max->next;
}
else
{
max->next->last=max->last;
max->last->next=max->next;
}
return(head);
}
void main()
{
int n;
struct student *head;
scanf("%d",&n);
head=creat(n);
print(head);
print(head);
print(head);
} | 14 |
6,562 |
int main (int argc, char *argv[])
{
int n;
scanf("%d",&n);
struct
{ int id;int yuwen;int shuxue;}stu[1000001];
int grade[100000];
int i,a,b;
int m1=0,m2=0,m3=0;
int m1id,m2id,m3id;
for(i=0;i<n;i++)
{
scanf("%d",&stu[i].id);
scanf("%d",&stu[i].yuwen);
scanf("%d",&stu[i].shuxue);
grade[i]=stu[i].yuwen+stu[i].shuxue;
}
for(i=0;i<n;i++)
{ if(grade[i]>m1)
{m1=grade[i];
a=i;
m1id=stu[i].id;}
}
printf("%d ",m1id);
printf("%d\n",m1);
for(i=0;i<n;i++)
{ if((grade[i]>m2)&&(i!=a))
{m2=grade[i];
b=i;
m2id=stu[i].id;}
}
printf("%d ",m2id);
printf("%d\n",m2);
for(i=0;i<n;i++)
{ if((grade[i]>m3)&&(i!=a)&&(i!=b))
{ m3=grade[i];
m3id=stu[i].id;
}
}
printf("%d ",m3id);
printf("%d\n",m3);
return 0;
}
| 14 |
6,563 | struct student
{
long num;
int scorec;
int scorem;
struct student *next;
};
struct student *creat(void)
{
struct student *head,*p0,*p1,*p2;
int i=0;
head=(struct student *)malloc(len);
head->next=NULL;
scanf("%ld %d %d",&head->num,&head->scorec,&head->scorem);
while(i<2)
{
p1=head;
p0=(struct student *)malloc(len);
scanf("%ld %d %d",&p0->num,&p0->scorec,&p0->scorem);
while((p0->scorec+p0->scorem)<=(p1->scorec+p1->scorem)&&(p1->next!=NULL))
{
p2=p1;
p1=p1->next;
}
if((p0->scorec+p0->scorem)>(p1->scorec+p1->scorem))
{
if(head==p1) head=p0;
else p2->next=p0;
p0->next=p1;
}
else
{
p1->next=p0;
p0->next=NULL;
}
i++;
}
return(head);
}
struct student *sort(struct student *head,int n)
{
struct student *p0,*p1,*p2;
int i=3;
while(i<n)
{
p1=head;
p0=(struct student*)malloc(len);
scanf("%ld %d %d",&p0->num,&p0->scorec,&p0->scorem);
while((p0->scorec+p0->scorem)<=(p1->scorec+p1->scorem)&&(p1->next!=NULL))
{
p1=p1->next;
}
if((p0->scorec+p0->scorem)>(p1->scorec+p1->scorem))
{
if(head==p1)
{
p2=p1->next;
(*p2->next).num=p2->num;
(*p2->next).scorec=p2->scorec;
(*p2->next).scorem=p2->scorem;
p2->num=p1->num;
p2->scorec=p1->scorec;
p2->scorem=p1->scorem;
p1->num=p0->num;
p1->scorec=p0->scorec;
p1->scorem=p0->scorem;
}
else if(p1==head->next)
{
(*p1->next).num=p1->num;
(*p1->next).scorec=p1->scorec;
(*p1->next).scorem=p1->scorem;
p1->num=p0->num;
p1->scorec=p0->scorec;
p1->scorem=p0->scorem;
}
else
{
p1->num=p0->num;
p1->scorec=p0->scorec;
p1->scorem=p0->scorem;
}
}
free(p0);
i++;
}
return(head);
}
void main()
{
struct student *head,*p1,*p2;
int n;
scanf("%d",&n);
head=creat();
head=sort(head, n);
p1=head->next;
p2=p1->next;
printf("%ld %d\n",head->num,(head->scorec+head->scorem));
printf("%ld %d\n",p1->num,(p1->scorec+p1->scorem));
printf("%ld %d",p2->num,(p2->scorec+p2->scorem));
} | 14 |
6,564 |
struct student
{
int num;
int chn;
int math;
int score;
} stu[100000];
main()
{
int n,i,a,b,c;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&stu[i].num,&stu[i].chn,&stu[i].math);
stu[i].score=stu[i].chn+stu[i].math;
}
if(stu[0].score>=stu[1].score){
if(stu[1].score>=stu[2].score){
a=0;
b=1;
c=2;
}
else if(stu[0].score>=stu[2].score){
a=0;
b=2;
c=1;
}
else{
a=2;
b=0;
c=1;
}
}
else{
if(stu[0].score>=stu[2].score){
a=1;
b=0;
c=2;
}
else if(stu[1].score>=stu[2].score){
a=1;
b=2;
c=0;
}
else{
a=2;
b=1;
c=0;
}
}
for(i=3;i<n;i++){
if(stu[i].score>stu[a].score){
c=b;
b=a;
a=i;
}
else if(stu[i].score>stu[b].score){
c=b;
b=i;
}
else if(stu[i].score>stu[c].score){
c=i;
}
}
printf("%d %d\n%d %d\n%d %d\n",stu[a].num,stu[a].score,stu[b].num,stu[b].score,stu[c].num,stu[c].score);
} | 14 |
6,565 | void main(int argc, char* argv[])
{
struct student
{
int No;
int chinese;
int math;
int total;
} stu[100000];
int i,j,x,y,z,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&stu[i].No);
scanf("%d",&stu[i].chinese);
scanf("%d",&stu[i].math);
stu[i].total=stu[i].chinese+stu[i].math;
}
for(j=0;j<3;j++){
x=0;
for(i=0;i<n;i++){
if( stu[i].total>x){
x=stu[i].total;
y=stu[i].No;
z=i;
}
}
printf("%d %d\n",y,x);
stu[z].total=0;
}
}
| 14 |
6,566 | /*
* mark.cpp
*
* Created on: 2011-12-9
* Author: admin
*/
struct student{
int id;
int chi;
int math;
};
struct maxer{
int id;
int mark;
};
int main(){
int n,i,j;
struct student a[100001],temp;
struct maxer max,top[3]; //top3????
cin>>n;
for (i=1;i<=n;i++){
cin>>a[i].id>>a[i].chi>>a[i].math;
}
for (i=1;i<=3;i++){ //????
max.mark=0;
for (j=i;j<=n;j++){
if (a[j].chi+a[j].math>max.mark){
max.id=a[j].id;
max.mark=a[j].chi+a[j].math; //?????
}
}
top[i-1]=max; //????????????????????????
temp=a[i];
a[i]=a[max.id];
a[max.id]=temp;
}
for (i=0;i<=2;i++){
cout<<top[i].id<<' '<<top[i].mark;
if (i!=2)cout<<endl;
}
return 0;
}
| 14 |
6,567 |
struct student{
int No;
int yuwen;
int shuxue;
int sum;
};
int main(){
int n,i,k,e,f;
scanf("%d",&n);
struct student *stu=(struct student*)malloc(sizeof(int)*4*n);
for(i=0;i<n;i++){
scanf("%d%d%d",&stu[i].No,&stu[i].yuwen,&stu[i].shuxue);
stu[i].sum=stu[i].yuwen+stu[i].shuxue;
}
for(k=0;k<3;k++){
for(i=n-1;i>k;i--){
if(stu[i-1].sum<stu[i].sum){
e=stu[i-1].sum;
stu[i-1].sum=stu[i].sum;
stu[i].sum=e;
f=stu[i-1].No;
stu[i-1].No=stu[i].No;
stu[i].No=f;
}
}
}
for(i=0;i<3;i++){
printf("%d %d\n",stu[i].No,stu[i].sum);
}
return 0;
}
| 14 |
6,568 | struct student
{
int ID;
int chinese;
int math;
int total;
}st[4],temp;
int main()
{
int n,cnt=3;
cin>>n;
for(int i=0;i<3;i++)
{
cin>>st[i].ID>>st[i].chinese>>st[i].math;
st[i].total=st[i].chinese+st[i].math;
}
do{
cin>>st[3].ID>>st[3].chinese>>st[3].math;
st[3].total=st[3].chinese+st[3].math;
cnt++;
for(int i=1;i<4;i++)
{
for(int j=0;j<4-i;j++)
{
if(st[j+1].total>st[j].total)
{
temp=st[j];
st[j]=st[j+1];
st[j+1]=temp;
}
}
}}while(cnt<n);
for(int i=0;i<3;i++)
{
cout<<st[i].ID<<" "<<st[i].total<<endl;
}
return 0;
}
| 14 |
6,569 | //#define NULL 0
struct student
{
int num;
int ch;
int math;
int sum;
struct student*next;
};
struct student *creat(int n)
{
struct student *head;
struct student *p1,*p2;
int i;
p1=p2=(struct student *)malloc(sizeof (struct student));
scanf("%d %d %d",&p1->num,&p1->ch,&p1->math);
//head=NULL;
for(i=0;i<n-1;i++)
{
if(i==0)head=p1;
p1=(struct student*)malloc(sizeof(struct student));
scanf("%d %d %d",&p1->num,&p1->ch,&p1->math);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return (head);
}
void print(struct student*head)
{
struct student*p;
p=head;
if(head!=NULL)
do
{
printf("%d %d %d",p->num,p->ch,p->math);
p=p->next;
}while(p!=NULL);
}
main()
{
int n,i,j,k,t;
struct student *p1,*p2,*p3,*p;
struct student g;
scanf("%d",&n);
p=creat(n);p1=p;
p2=p;p3=p;
for(i=0;i<n;i++)
{
p1->sum=p1->math+p1->ch;
//printf("%d\n",p1->sum);
p1=p1->next;
}
p1=p;p2=p;printf("\n\n");
i=0;
while(i<3)
{
p1=p2->next;
while(p1!=NULL)
{
if((p2->sum)<(p1->sum))
{
g.num=p2->num;
p2->num=p1->num;
p1->num=g.num;
g.sum=p2->sum;
p2->sum=p1->sum;
p1->sum=g.sum;
}
p1=p1->next;
}
p2=p2->next;i=i+1;
}
p1=p;p2=p;
//printf("\n\n");
/*for(i=0;i<n;i++)
{
printf("%d\n",p1->sum);
p1=p1->next;
}*/
p1=p;
for(i=0;i<3;i++)
{
printf("%d %d\n",p1->num,p1->sum);
p1=p1->next;
}
}
| 14 |
6,570 | int main(int argc, char* argv[])
{
int n,a[99999],b[2],i,k,m,s[99999],first=0,x,y;
scanf ("%d",&n);
for (i=0;i<n;i++)
{
scanf ("%d",&a[i]);
for (k=0;k<2;k++)
{
scanf("%d",&b[k]);
}
s[i]=b[0]+b[1];
}
for (m=0;m<3;m++)
{ first=0;
for (x=0;x<n;x++)
{
if (s[x]>first)
{first=s[x];
y=x+1;
}
}
printf ("%d %d\n",y,first);
s[y-1]=0;
}
return 0;
}
| 14 |
6,571 | struct student
{
int num;
int score1;
int score2;
int total;
}stu[100000];
int main()
{
int n,i,j,k,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].score1,&stu[i].score2);
stu[i].total=stu[i].score1+stu[i].score2;
}
for(i=0;i<3;i++)
{
k=i;
for(j=i+1;j<n;j++)
if(stu[j].total>stu[k].total)k=j;
if(k!=i)
{
t=stu[i].total;stu[i].total=stu[k].total;stu[k].total=t;
t=stu[i].num;stu[i].num=stu[k].num;stu[k].num=t;}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",stu[i].num,stu[i].total);
}
}
| 14 |
6,572 | void swap(int *i,int *j)
{
int *p=i,t=*i;
*p=*j;
p=j;
*p=t;
}
struct Student
{
int id;
int chinese;
int math;
};
int main()
{
void swap(int *i,int *j);
int n,i,first,second,third,one,two,three;
int *f=&first,*s=&second,*t=&third,*on=&one,*tw=&two,*th=&three;
struct Student stu[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].id,&stu[i].chinese,&stu[i].math);
int total=stu[i].chinese+stu[i].math,k;
int *to=&total,*K=&k;
if(i==0)
{
first=total;
one=i;
}
else
{
if(i==1)
{
if(total>first)
{
swap(to,f);
second=total;
k=i;
swap(K,on);
two=k;
}
else
{
second=total;
two=i;
}
}
else
{
if(i==2)
{
if(total>first)
{
swap(to,f);
swap(to,s);
third=total;
k=i;
swap(K,on);
swap(K,tw);
three=k;
}
else
{
if(total>second&&total<=first)
{
swap(to,s);
third=total;
k=i;
swap(K,tw);
three=k;
}
else
{
third=total;
three=i;
}
}
}
else
{
if(total>first)
{
swap(to,f);
swap(to,s);
swap(to,t);
k=i;
swap(K,on);
swap(K,tw);
swap(K,th);
}
else
{
if(total>second)
{
swap(to,s);
swap(to,t);
k=i;
swap(K,tw);
swap(K,th);
}
else
{
if(total>third)
{
swap(to,t);
k=i;
swap(K,th);
}
}
}
}
}
}
}
printf("%d %d\n",stu[one].id,first);
printf("%d %d\n",stu[two].id,second);
printf("%d %d\n",stu[three].id,third);
return 0;
} | 14 |
6,573 | int max=0;
struct student
{ char id[20];
int chinese;
int math;
int sum;
int flag;
struct student *next;
};
struct student *h;
int n,i;
struct student *creat()
{
struct student *head,*p1,*p2;
i=0;
p1=p2=(struct student*)malloc(LEN);
scanf("%s %d %d",p1->id,&p1->chinese,&p1->math);
p1->sum=p1->chinese+p1->math;
p1->flag=0;
head=NULL;
while(i<n)
{
i=i+1;
if(i==1) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student*)malloc(LEN);
scanf("%s %d %d",p1->id,&p1->chinese,&p1->math);
p1->sum=p1->chinese+p1->math;
p1->flag=0;
}
p2->next=NULL;
return(head);
}
struct student *compare()
{
struct student *p1,*p3;
p1=h;
max=p1->sum;
do
{
if(p1->sum>max&&(p1->flag==0))
max=p1->sum;
p1=p1->next;
}while(p1->next!=NULL);
p1=h;
do
{
if (p1->sum==max&&(p1->flag==0))
{
p3=p1;
p1->flag=1;
break;
}
p1=p1->next;
}while(p1->next!=NULL);
return(p3);
}
void main()
{ int j;
struct student *p;
scanf("%d",&n);
h=creat();
for(j=1;j<=3;j++)
{
p=compare();
printf("%s %d\n",p->id,p->sum);
}
} | 14 |
6,574 | int main()
{
int n,i,m;
int a,b,c;
int j,k,v;
int sum[100000];
int max1=0,max2=0,max3=0;
int A[100000][1];
scanf ("%d",&n);
for (i=1;i<=n;i++)
{
scanf ("%d %d %d",&m,&A[i][0],&A[i][1]);
sum[i]=A[i][0]+A[i][1];
}
for (j=1;j<=n;j++)
{
if (sum[j]>max1)
{max1=sum[j];
a=j;}
}
for (k=1;k<=n;k++)
{
if (sum[k]>max2&&k!=a)
{max2=sum[k];
b=k;}
}
for (v=1;v<=n;v++)
{
if (sum[v]<max2)
{
if (sum[v]>max3)
{max3=sum[v];
c=v;}
}
}
printf ("%d %d\n",a,max1);
printf ("%d %d\n",b,max2);
printf ("%d %d",c,max3);
return 0;
}
| 14 |
6,575 | struct student
{
int id;
int score1;
int score2;
struct student *next;
};
struct student *head;
struct student *creat(int x)
{
struct student *p1,*p2;
p1=p2=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->id,&p1->score1,&p1->score2);
head=0;
while(p1->id<x)
{
if(p1->id==1)
head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->id,&p1->score1,&p1->score2);
if(p1->id==x){
p2->next=p1;
p2=p1;
}
}
p2->next=0;
return(head);
}
void main()
{
int n;
struct student *p,*q,*j,*k;
scanf("%d",&n);
creat(n);
p=q=head;
do{
if((p->score1+p->score2)>(q->score1+q->score2))
q=p;
p=p->next;
}while(p!=0);
p=j=head;
do{
if((p->score1+p->score2)>(j->score1+j->score2)&&p!=q)
j=p;
p=p->next;
}while(p!=0);
p=k=head;
do{
if((p->score1+p->score2)>(k->score1+k->score2)&&p!=q&&p!=j)
k=p;
p=p->next;
}while(p!=0);
printf("%d %d\n",q->id,(q->score1+q->score2));
printf("%d %d\n",j->id,(j->score1+j->score2));
printf("%d %d",k->id,(k->score1+k->score2));
} | 14 |
6,576 | struct student
{
int num;
int score1;
int score2;
int sum;
}stu[100000],max,secondmax,thirdmax;
int main()
{
max.sum=secondmax.sum=thirdmax.sum=0;
int i,n;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].score1,&stu[i].score2);
stu[i].sum=stu[i].score1+stu[i].score2;
}
for (i=0;i<n;i++)
{
if (stu[i].sum>max.sum)
max=stu[i];
}
for (i=0;i<n;i++)
{
if (stu[i].sum<max.sum&&stu[i].sum>secondmax.sum)
secondmax=stu[i];
}
for (i=0;i<n;i++)
{
if (stu[i].sum==max.sum&&stu[i].num!=max.num)
{
secondmax=stu[i];
break;
}
}
for (i=0;i<n;i++)
{
if (stu[i].sum<secondmax.sum&&stu[i].sum>thirdmax.sum)
thirdmax=stu[i];
}
for (i=0;i<n;i++)
{
if (stu[i].sum==secondmax.sum&&stu[i].num!=max.num&&stu[i].num!=secondmax.num)
{
thirdmax=stu[i];
break;
}
}
printf("%d %d\n%d %d\n%d %d",max.num,max.sum,secondmax.num,secondmax.sum,thirdmax.num,thirdmax.sum);
return 0;
} | 14 |
6,577 | struct stu
{long num;
int Chi;
int Math;
int Sum;
struct stu *next;
}*p1,*p2;
//????
struct stu * creat(int n)
{struct stu *head=NULL;
int i;
for(i=0;i<n;i++)
{
p1=(struct stu *)malloc(sizeof(struct stu));
scanf("%d %d %d",&p1->num,&p1->Chi,&p1->Math);
p1->Sum=p1->Chi+p1->Math;
if(i==0){ head=p1; p2=p1;}
else
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return(head);
}
struct stu *Bigthree(struct stu *head)
{int t;
struct stu *max,*premax,*New,*Newhead=NULL;
for(t=0;t<3;t++)
{
premax=NULL;
max=head;
p2=head;
p1=head->next;
while(p1!=NULL)
{
if((p1->Sum)>(max->Sum))
{premax=p2;
max=p1;
}
p2=p2->next;
p1=p1->next;
}
if(max == head)
head = head->next;
else premax->next=max->next;
max->next=NULL;
if(t==0){Newhead=max;
New=Newhead;}
else
New=New->next=max;
}
New->next=NULL;
return(Newhead);
}
//???????????
void output(struct stu *head)
{struct stu *p;
for(p=head;p!=NULL;printf("%d %d\n",p->num,p->Sum),p=p->next);
}
void main()
{int n;
struct stu *head;
scanf("%d",&n);
head=creat(n);
head=Bigthree(head);
output(head);
}
| 14 |
6,578 | struct student
{
int num;
int Chinese;
int math;
int sum;
};
void main()
{
int i,n,p,q,r,b=0,c=0,d=0;
struct student a[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a[i].num,&a[i].Chinese,&a[i].math);
a[i].sum=a[i].Chinese+a[i].math;
if(i==0)
p=q=r=a[i].sum;
else
{
if(a[i].sum>p)
{
r=q;
q=p;
p=a[i].sum;
d=c;
c=b;
b=i;
}
else if(a[i].sum>q)
{
r=q;
q=a[i].sum;
d=c;
c=i;
}
else if(a[i].sum>r)
{
r=a[i].sum;
d=i;
}
}
}
printf("%d %d\n%d %d\n%d %d\n",a[b].num,a[b].sum,a[c].num,a[c].sum,a[d].num,a[d].sum);
} | 14 |
6,579 | struct student
{
int id;
int cs;
int ms;
int s;
struct student *next;
};
void main()
{
int n,i,m=0;
scanf("%d",&n);
struct student *head,*p1,*p2;
p1=p2=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->id,&p1->cs,&p1->ms);
p1->s=p1->cs+p1->ms;
head=NULL;
while(p1->id!=n)
{
m=m+1;
if(m==1) head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->id,&p1->cs,&p1->ms);
p1->s=p1->cs+p1->ms;
}
p2->next=p1;
p2=p1;
p2->next=NULL;
for(i=0;i<3;i++)
{
p1=p2=head;
do
{
p2=p2->next;
if(p1->s<p2->s)
p1=p2;
}while(p2->next!=NULL);
printf("%d %d\n",p1->id,p1->s);
p1->s=-1;
}
}
| 14 |
6,580 | struct student
{
long int num;
int Chinese;
int Maths;
int total;
};
void main()
{
struct student stu[100000];
struct student tempt;
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&stu[i].num,&stu[i].Chinese,&stu[i].Maths);
stu[i].total=stu[i].Chinese+stu[i].Maths;
}
if(stu[2].total>stu[1].total){
tempt=stu[1];
stu[1]=stu[2];
stu[2]=tempt;
}
if(stu[1].total>stu[0].total){
tempt=stu[0];
stu[0]=stu[1];
stu[1]=tempt;
}
if(stu[2].total>stu[1].total){
tempt=stu[1];
stu[1]=stu[2];
stu[2]=tempt;
}
for(i=3;i<n;i++){
if(stu[i].total>stu[2].total){
stu[2]=stu[i];
if(stu[2].total>stu[1].total){
tempt=stu[1];
stu[1]=stu[2];
stu[2]=tempt;
if(stu[1].total>stu[0].total){
tempt=stu[0];
stu[0]=stu[1];
stu[1]=tempt;
}
}
}
}
printf("%d %d\n",stu[0].num,stu[0].total);
printf("%d %d\n",stu[1].num,stu[1].total);
printf("%d %d\n",stu[2].num,stu[2].total);
} | 14 |
6,581 | int main()
{
int num[3], chinese[100000], math[100000], sum[100000];
int m, i, n;
cin >> n;
for (i = 0; i < n; i ++)
{
cin >> m >> chinese[i] >> math[i];
sum[i] = chinese[i] + math[i];
}
int largest = 0;
for (i = 0; i < 3; i ++)
{
largest = 0;
for (int j = 0; j < n; j ++)
if (sum[j] > largest)
{
largest = sum[j];
num[i] = j;
}
cout << num[i] + 1 << " " << sum[num[i]] << endl;
sum[num[i]] = 0;
}
return 0;
}
| 14 |
6,582 | int main()
{
struct student
{
int num;
int chinese;
int mathematics;
int sum;
}temp;
struct student stu[100000];
int i,j,n;
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%d %d %d",&stu[i].num,&stu[i].chinese,&stu[i].mathematics);
stu[i].sum=stu[i].chinese+stu[i].mathematics;
}
for (i=0;i<3;i++){
for (j=0;j<n-i-1;j++){
if (stu[j].sum>=stu[j+1].sum){
temp=stu[j];
stu[j]=stu[j+1];
stu[j+1]=temp;
}
}
}
for (i=n-1;i>=n-3;i--){
printf("%d %d\n",stu[i].num,stu[i].sum);}
return 0;
}
| 14 |
6,583 | struct grade
{
int num;
int chinese;
int math;
int all;
}stu[100000];
int main()
{
int n,i,e,f,g,a,b,c;
e=0;
f=0;
g=0;
a=0;
b=0;
c=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%d%d%d",&stu[i].num,&stu[i].chinese,&stu[i].math);
stu[i].all=stu[i].chinese+stu[i].math;
}
for(i=0;i<=n-1;i++){
if(stu[i].all>e){
e=stu[i].all;
a=i;
}
}
for(i=0;i<=n-1;i++){
if(stu[i].all<=e&&stu[i].all>f&&i!=a){
f=stu[i].all;
b=i;
}
}
for(i=0;i<=n-1;i++){
if(stu[i].all<=f&&stu[i].all>g&&i!=a&&i!=b){
g=stu[i].all;
c=i;
}
}
printf("%d %d\n",stu[a].num,stu[a].all);
printf("%d %d\n",stu[b].num,stu[b].all);
printf("%d %d\n",stu[c].num,stu[c].all);
return 0;
} | 14 |
6,584 | int main()
{
struct stu
{
int a,b,c;
struct stu *next;
struct stu *back;
};
struct stu *head,*p1,*p2,*p,*pmax1,*pmax2,*pmax3;
int n,i,j,max1,max2,max3;
scanf("%d",&n);
p1=p2=(struct stu *)malloc(sizeof(struct stu));
scanf("%d %d %d",&p1->a,&p1->b,&p1->c);
head=p1;
for(i=1;i<n;i++)
{
p1=(struct stu *)malloc(sizeof(struct stu));
p2->next=p1;
p1->back=p2;
p2=p1;
scanf("%d %d %d",&p1->a,&p1->b,&p1->c);
}
p=head;
max1=0;
for (i=0;i<n;i++)
{
if (max1<(p->b+p->c))
{
max1=p->b+p->c;
pmax1=p;
}
p=p->next;
}
p=head;
max2=0;
for (i=0;i<n;i++)
{
if (max2<(p->b+p->c)&&(p!=pmax1))
{
max2=p->b+p->c;
pmax2=p;
}
p=p->next;
}
p=head;
max3=0;
for (i=0;i<n;i++)
{
if (max3<(p->b+p->c)&&(p!=pmax1)&&(p!=pmax2))
{
max3=p->b+p->c;
pmax3=p;
}
p=p->next;
}
printf("%ld %d\n",pmax1->a,(pmax1->b+pmax1->c));
printf("%ld %d\n",pmax2->a,(pmax2->b+pmax2->c));
printf("%ld %d\n",pmax3->a,(pmax3->b+pmax3->c));
return 0;
} | 14 |
6,585 | int main()
{
struct student
{
int ID,Chinese,math,sum;
}
stu[100000],temp1,temp2,temp3;
int n,i,j,k;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[i].ID,&stu[i].Chinese,&stu[i].math);
stu[i].sum=stu[i].Chinese+stu[i].math;
}
temp1=stu[0];
for(i=1;i<n-1;i++)
if(stu[i].sum>temp1.sum)
temp1=stu[i];
printf("%d %d\n",temp1.ID,temp1.sum);
if(temp1.ID==stu[0].ID) temp2=stu[1];
else temp2=stu[0];
for(i=1;i<n-1;i++)
{if(stu[i].ID==temp1.ID) continue;
else if(stu[i].sum>temp2.sum) temp2=stu[i];}
printf("%d %d\n",temp2.ID,temp2.sum);
for(i=0;i<n;i++)
if(stu[i].ID==temp1.ID||stu[i].ID==temp2.ID)
stu[i].sum=0;
temp3=stu[0];
for(i=1;i<n-1;i++)
if(stu[i].sum>temp3.sum)
temp3=stu[i];
printf("%d %d\n",temp3.ID,temp3.sum);
return 0;
}
| 14 |
6,586 | struct student
{
int a;
int b;
int c;
int d;
struct student *next;
};
int n;
struct student *creat(int i)
{
struct student *head,*p1,*p2;
n=0;
p1=p2=(struct student *)malloc(sizeof(struct student));
scanf("%d %d %d",&p1->a,&p1->b,&p1->c);
p1->d=p1->c+p1->b;
head=NULL;
while(n<i-1)
{
n=n+1;
if(n==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(sizeof(struct student));
scanf("%d %d %d",&p1->a,&p1->b,&p1->c);
p1->d=p1->c+p1->b;
}
p2->next=NULL;
return(head);
}
void del(struct student *ahead,int num)
{ struct student *p1,*p2;
p1=ahead;
while(num!=p1->d&&p1->next!=NULL)
{p2=p1;p1=p1->next;}
if(num==p1->d)
{
if(p1==ahead){printf("%d %d\n",p1->a,p1->d);ahead=p1->next;}
else{printf("%d %d\n",p1->a,p1->d);p2->next=p1->next;}
}
}
void print(struct student *head)
{
int i;
struct student *p;
for(i=0;i<3;i++)
{
p=head;
int max=p->d;
while(p->next!=NULL)
{
p=p->next;
if(max<p->d)
max=p->d;
}
del(head,max);
}
}
void main()
{
int i;
scanf("%d",&i);
struct student *ahead;
ahead=creat(i);
print(ahead);
}
| 14 |
6,587 |
struct student
{
int num,y,b,he;
}a[100003];
void main()
{
int n,i,j,he,k;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d %d %d",&a[i].num,&a[i].y,&a[i].b);
a[i].he=a[i].y+a[i].b;
};
for (i=1;i<=2;i++)
{
k=i;
for (j=i+1;j<=n;j++)
if (a[j].he>a[k].he) k=j;
printf("%d %d",a[k].num,a[k].he);
printf("\n");
a[k].he=0;
}
k=1;
for (j=i+1;j<=n;j++)
if (a[j].he>a[k].he) k=j;
printf("%d %d",a[k].num,a[k].he);
a[k].he=0;
} | 14 |
6,588 | struct student
{
int num;
int sum;
};
int main()
{
int n,i,j,t,a,b,m;
int tempSum;
int tempMax;
int rank[3]={0};
scanf("%d",&n);
struct student * stu;
stu = (struct student *)malloc(sizeof(struct student) * n);
for(i=0;i<n;i++)
{
tempSum = 0;
scanf("%d",&stu[i].num);
stu[i].sum = 0;
for(j=0;j<2;j++){
scanf("%d",&tempSum);
stu[i].sum += tempSum;
}
}
for(b=0;b<3;b++)
{
tempMax = 0;
for(a=b;a<n;a++)
{
if(stu[a].sum > tempMax){
tempMax = stu[a].sum;
rank[b] = a;
}
}
t = stu[b].num;
stu[b].num = stu[rank[b]].num;
stu[rank[b]].num = t;
t = stu[b].sum;
stu[b].sum = stu[rank[b]].sum;
stu[rank[b]].sum = t;
}
for(a=0;a<3;a++)
printf("%d %d\n",stu[a].num,stu[a].sum);
return 0;
}
| 14 |
6,589 |
struct student
{
int num;
int chinese;
int math;
int total;
};
int main()
{
int n;
scanf("%d",&n);
struct student *stu=(struct student *)malloc(sizeof(int)*4*n);
int i;
for(i=0;i<n;i++){
scanf("%d%d%d",&stu[i].num,&stu[i].chinese,&stu[i].math);
}
for(i=0;i<n;i++){
stu[i].total=stu[i].chinese+stu[i].math;
}
int t_1,t_2;
int j,k;
for(k=1;k<4;k++){
for(j=0;j<n-k;j++){
if(stu[j].total>=stu[j+1].total){
t_1=stu[j+1].total;
stu[j+1].total=stu[j].total;
stu[j].total=t_1;
t_2=stu[j+1].num;
stu[j+1].num=stu[j].num;
stu[j].num=t_2;
}
}
}
for(i=n-1;i>n-4;i--){
printf("%d %d\n",stu[i].num,stu[i].total);
}
return 0;
}
| 14 |
6,590 | struct Student
{
long id;
int chn;
int mth;
int total;
};
void main()
{
struct Student *p1,*top1,*top2,*top3,*temp;
int i;
long int n;
scanf("%ld",&n);
top1=(struct Student*)malloc(sizeof(struct Student));
top2=(struct Student*)malloc(sizeof(struct Student));
top3=(struct Student*)malloc(sizeof(struct Student));
temp=(struct Student*)malloc(sizeof(struct Student));
scanf("%d %d %d",&top1->id,&top1->chn,&top1->mth);
top1->total=top1->chn + top1->mth;
scanf("%d %d %d",&top2->id,&top2->chn,&top2->mth);
top2->total=top2->chn + top2->mth;
if(top2->total>top1->total)
{
temp=top2;
top2=top1;
top1=temp;
}
scanf("%d %d %d",&top3->id,&top3->chn,&top3->mth);
top3->total=top3->chn + top3->mth;
if(top3->total>top2->total)
{
temp=top3;
top3=top2;
top2=temp;
}
if(top2->total>top1->total)
{
temp=top2;
top2=top1;
top1=temp;
}
for(i=3;i<n;i++)
{
p1=(struct Student*)malloc(sizeof(struct Student));
scanf("%d %d %d",&p1->id,&p1->chn,&p1->mth);
p1->total=p1->chn + p1->mth;
if (top1->total< p1->total) {top3=top2;top2=top1;top1=p1;continue;}
if (top2->total< p1->total) {top3=top2;top2=p1;continue;}
if (top3->total< p1->total) {top3=p1;continue;}
free (p1);
}
printf("%d %d\n%d %d\n%d %d\n",top1->id,top1->total,top2->id,top2->total,top3->id,top3->total);
} | 14 |
6,591 | int main(int argc, char* argv[])
{
struct test {
int ID,chinese,maths,sum;
} ss[100000];
int i,n;
scanf ("%d",&n);
for (i=1;i<=n;i++)
{
scanf ("%d%d%d",&ss[i].ID,&ss[i].chinese,&ss[i].maths);
ss[i].sum=ss[i].chinese+ss[i].maths;
}
struct score {
int ID,sum;
} s[5];
s[1].sum=0;
s[2].sum=0;
s[3].sum=0;
for (i=0;i<=n;i++)
{
if (ss[i].sum>s[1].sum)
{
s[3].ID=s[2].ID;
s[3].sum=s[2].sum;
s[2].ID=s[1].ID;
s[2].sum=s[1].sum;
s[1].ID=ss[i].ID;
s[1].sum=ss[i].sum;
}
else if (ss[i].sum>s[2].sum)
{
s[3].ID=s[2].ID;
s[3].sum=s[2].sum;
s[2].ID=ss[i].ID;
s[2].sum=ss[i].sum;
}
else if (ss[i].sum>s[3].sum)
{
s[3].ID=ss[i].ID;
s[3].sum=ss[i].sum;
}
}
for (i=1;i<=3;i++)
{
printf ("%d %d\n",s[i].ID,s[i].sum);
}
return 0;
}
| 14 |
6,592 | void main()
{
struct stu
{int num;
int chi;
int mat;
}stu[100000];
int n,i,max1,max2,max3,maxn1,maxn2,maxn3;
int sum[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&stu[i].num);
scanf("%d",&stu[i].chi);
scanf("%d",&stu[i].mat);
sum[i]=stu[i].chi+stu[i].mat;
}
max1=sum[0];
maxn1=stu[0].num;
for(i=1;i<n;i++)
{
if(sum[i]>max1)
{
max1=sum[i];
maxn1=stu[i].num;
}
}
printf("%d %d\n",maxn1,max1) ;
max2=sum[0];
maxn2=stu[0].num;
for(i=1;i<n;i++)
{
if(sum[i]>max2&&i!=maxn1-1)
{
max2=sum[i];
maxn2=stu[i].num;
}
}
printf("%d %d\n",maxn2,max2) ;
max3=sum[0];
maxn3=stu[0].num;
for(i=1;i<n;i++)
{
if(sum[i]>max3&&i!=maxn1-1&&i!=maxn2-1)
{
max3=sum[i];
maxn3=stu[i].num;
}
}
printf("%d %d\n",maxn3,max3) ;
} | 14 |
6,593 |
int main()
{
struct Student
{
int ID;
int Chinese;
int Math;
int sum;
}student[100000];
int i,j,n;
struct Student t;
scanf("%d", &n);
for(i=0;i<n;i++)
scanf("%d%d%d",&student[i].ID,&student[i].Chinese,&student[i].Math);
for(i=0;i<3;i++)
{
for(j=i+1;j<n;j++)
{
if(student[i].Chinese+student[i].Math<student[j].Chinese+student[j].Math)
{
t=student[i];
student[i]=student[j];
student[j]=t;
}
}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",student[i].ID,student[i].Chinese+student[i].Math);
}
return 0;
}
| 14 |
6,594 | struct student
{
char number[20];
int chinese;
int math;
int sum;
struct student *next;
}stu[100000],*s1,*s2,*s3;
int n,max1=0,max2=0,max3=0;
struct student *creat(void)
{
int i;
struct student *head,*p1,*p2;
p1=p2=(struct student*)malloc(LEN);
for(i=0;i<n;i++)
{
scanf("%s%d%d",&p1->number,&p1->chinese,&p1->math);
p2=p1;
p1->sum=p1->chinese+p1->math;
if(p1->sum>max1)
{max3=max2;s3=s2;max2=max1;s2=s1;max1=p1->sum;s1=p1;}
else if(p1->sum>max2)
{max3=max2;s3=s2;max2=p1->sum;s2=p1;}
else if(p1->sum>max3)
{max3=p1->sum;s3=p1;}
if(i==0)head=p1;
else p2->next=p1;
p1=(struct student*)malloc(LEN);
}
p1=NULL;
return(head);
}
void main()
{
struct student *p;
scanf("%d",&n);
p=creat();
printf("%s %d\n",s1->number,s1->sum);
printf("%s %d\n",s2->number,s2->sum);
printf("%s %d",s3->number,s3->sum);
}
| 14 |
6,595 | int main()
{
int n,i,j,b,c;
struct student
{
int id;
int score;
}stu[100000],t;
cin>>n;
for(i=0;i<n;i++)
{
cin>>stu[i].id>>b>>c;
stu[i].score=b+c;
}
for(i=0;i<3;i++)
{
for(j=n-1;j>i;j--)
{
if(stu[j].score>stu[j-1].score)
{
t=stu[j];
stu[j]=stu[j-1];
stu[j-1]=t;
}
}
}
for(i=0;i<3;i++)
{
cout<<stu[i].id<<' '<<stu[i].score<<endl;
}
return 0;
} | 14 |
6,596 | struct student
{
char num[6];
int score[2];
int sum;
} stu[100000];
void main()
{
long n,i,j,maxi1,maxi2,maxi3;
int max1=0,max2=0,max3=0;
scanf("%ld",&n);
for(i=0;i<n;i++)
{
scanf("%s",stu[i].num);
for(j=0;j<2;j++)
scanf("%d",&stu[i].score[j]);
}
for(i=0;i<n;i++)
stu[i].sum=stu[i].score[0]+stu[i].score[1];
for(i=0;i<n;i++)
if(stu[i].sum>max1)
{max1=stu[i].sum;
maxi1=i;
}
stu[maxi1].sum=0;
for(i=0;i<n;i++)
if(stu[i].sum>max2)
{max2=stu[i].sum;
maxi2=i;
}
stu[maxi2].sum=0;
for(i=0;i<n;i++)
if(stu[i].sum>max3)
{max3=stu[i].sum;
maxi3=i;
}
printf("%s %d\n%s %d\n%s %d",stu[maxi1].num,max1,stu[maxi2].num,max2,stu[maxi3].num,max3);
}
| 14 |
6,597 | struct student
{
int count;
int yu;
int shu;
}stu[1000000];
void main()
{
int n,i,*p,max=0,sm=0,tm=0,j=0;
p=(int *)malloc(1000000*sizeof(int));
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].count,&stu[i].yu,&stu[i].shu);
*(p+i)=stu[i].yu+stu[i].shu;
}
for(i=0;i<n;i++)
max=(max>*(p+i))?max:(*(p+i));
for(i=0;i<n;i++)
{if((*(p+i)<max)&&(*(p+i)>sm))
sm=*(p+i);}
for(i=0;i<n;i++)
{if((*(p+i)>tm)&&(*(p+i)<sm))
tm=*(p+i);}
for(i=0;j<3,i<n;i++)
{
if(*(p+i)==max)
{
printf("%d %d\n",stu[i].count,max);
j++;
}
}
for(i=0;j<3,i<n;i++)
{if(*(p+i)==sm&&j<3)
{
printf("%d %d\n",stu[i].count,sm);
j++;
}
}
for(i=0;j<3,i<n;i++)
{
if(*(p+i)==tm&&j<3)
{
printf("%d %d\n",stu[i].count,tm);
j++;
}
}
} | 14 |
6,598 |
typedef struct {
int d;
int score;
} student;
int main()
{
int n, i, temp1, temp2;
student a[100002];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d%d", &a[i].d, &temp1, &temp2);
a[i].score = temp1 + temp2;
}
student max1, max2, max3;
max1.d = max2.d = max3.d = -1;
max1.score = max2.score = max3.score = 0;
for (i = 0; i < n; i++) {
if (a[i].score > max1.score) {
max3 = max2;
max2 = max1;
max1 = a[i];
}
else if (a[i].score > max2.score) {
max3 = max2;
max2 = a[i];
}
else if (a[i].score > max3.score) {
max3 = a[i];
}
}
printf("%d %d\n", max1.d, max1.score);
if (max2.d != -1)
printf("%d %d\n", max2.d, max2.score);
if (max3.d != -1)
printf("%d %d\n", max3.d, max3.score);
return 0;
}
| 14 |
6,599 | struct student
{
int num;
int yu;
int shu;
int he;
struct student *next;
};
struct student *create(int n)
{
struct student *head,*p1,*p2;
int i;
p1=(struct student*)malloc(len);
scanf("%d %d %d",&p1->num,&p1->yu,&p1->shu);
p1->he=p1->yu+p1->shu;
p1->next=NULL;
head=p1;
p2=p1;
for(i=1;i<=n-1;i++)
{
p1=(struct student*)malloc(len);
scanf("%d %d %d",&p1->num,&p1->yu,&p1->shu);
p1->he=p1->yu+p1->shu;
p1->next=NULL;
p2->next=p1;
p2=p1;
}
return head;
}
struct student *max(struct student *head)
{
struct student *p,*m;
m=head;
p=head->next;
while(p)
{
if(p->he>m->he) m=p;
p=p->next;
}
return m;
}
void main()
{
int n,i;
struct student *head,*m;
struct student *create(int n);
struct student *max(struct student *head);
scanf("%d",&n);
head=create(n);
for(i=1;i<=3;i++)
{
m=max(head);
printf("%d %d\n",m->num,m->he);
m->he=-1;
}
}
| 14 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.