id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
6,600 | int main()
{int n,sum[100000],a,b,c;
struct xues{int a,b,c;} s[100000];
scanf ("%d",&n);
int i;
for(i=0;i<n;i++){
scanf("%d%d%d",&s[i].a,&s[i].b,&s[i].c);
sum[i]=s[i].b+s[i].c;
}
int fir=0,sec=0,thi=0;
for(i=0;i<n;i++){
if(fir<sum[i]){
thi=sec;
sec=fir;
fir=sum[i];
c=b;
b=a;
a=s[i].a;
}
else if(sec<sum[i]){
thi=sec;
sec=sum[i];
fir=fir;
a=a;
c=b;
b=s[i].a;
}
else if(thi<sum[i]){
fir=fir;
sec=sec;
thi=sum[i];
a=a;
b=b;
c=s[i].a;
}
}
printf("%d %d\n%d %d\n%d %d",a,fir,b,sec,c,thi);
return 0;
}
| 14 |
6,601 |
int main (){
int n, i, k;
struct stu{
int id;
int chn;
int math;
int total;
};
struct stu a[100001];
scanf("%d\n", &n);
for (i=0; i<n; i++){
scanf ("%d %d %d", &a[i].id, &a[i].chn, &a[i].math);
(a[i].total)=(a[i].chn)+(a[i].math);
}
for (k=1; k<5; k++){
for (i=0; i<n-k; i++){
if ((a[i].total)>=(a[i+1].total)){
a[100000].id=a[i].id;
a[100000].total=a[i].total;
a[i].id=a[i+1].id;
a[i+1].id=a[100000].id;
a[i].total=a[i+1].total;
a[i+1].total=a[100000].total;}
}
}
printf("%d %d\n", a[n-1].id, a[n-1].total);
printf("%d %d\n", a[n-2].id, a[n-2].total);
printf("%d %d\n", a[n-3].id, a[n-3].total);
return 0;
} | 14 |
6,602 | struct Student
{
int num;
int chinese;
int maths;
};
struct qiansan
{
int num;
int zongfen;
}st[3]={{0,0},{0,0},{0,0}};
main()
{
int n,i,k,c[10],j[10];
int a[100001];
scanf("%d",&n);
struct Student std[100001];
for(i = 0;i < n;i++)
{
scanf("%d %d %d",&std[i].num,&std[i].chinese,&std[i].maths);
}
for(i = 0;i < n;i++)
{
a[i] = std[i].chinese + std[i].maths;
}
for(i = 0;i < n;i++)
{
if(a[i]>st[0].zongfen)
{
st[2]=st[1];
st[1]=st[0];
st[0].zongfen=a[i];
st[0].num=std[i].num;
}
else if(a[i] <= st[0].zongfen && a[i] > st[1].zongfen)
{
st[2]=st[1];
st[1].zongfen=a[i];
st[1].num=std[i].num;
}
else if(a[i] <= st[1].zongfen && a[i]>st[2].zongfen)
{
st[2].zongfen=a[i];
st[2].num=std[i].num;
}
}
for(i = 0;i < 3;i++)
{
printf("%d %d\n",st[i].num,st[i].zongfen);
}
getchar();
getchar();
}
| 14 |
6,603 | int main()
{
struct student
{
int num;
int scorechinese;
int scoremath;
int sum;
}a[100000];
int n,i,j,temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&a[i].num,&a[i].scorechinese,&a[i].scoremath);
a[i].sum=a[i].scorechinese+a[i].scoremath;
}
for(i=0;i<3;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i].sum<a[j].sum)
{
temp=a[i].sum,a[i].sum=a[j].sum,a[j].sum=temp;
temp=a[i].num,a[i].num=a[j].num,a[j].num=temp;
}
}
printf("%d %d\n",a[i].num,a[i].sum);
}
return 0;
}
| 14 |
6,604 | int main()
{
struct stu{
int chi;
int ma;
int sum;
int i;
};
struct stu m[100000],temp;
int j,n;
scanf("%d",&n);
struct stu *p=m;
struct stu *q;
for(;p<m+n;p+=1)
{
scanf("%d%d%d",&(*p).i,&(*p).chi,&(*p).ma);
(*p).sum=(*p).chi+(*p).ma;
}
for(p=m;p<m+n-1;p++)
{
for(q=p+1;q<m+n;q++)
{
if((*p).sum < (*q).sum)
{
temp=*p;
*p=*q;
*q=temp;
}
}
if(p==m+2)
break;
}// max is m[0]
for(p=m;p<m+3;p++)
{
printf("%d %d\n",(*p).i,(*p).sum);
}
return 0;
} | 14 |
6,605 |
main()
{
struct student
{int num;
int sc;
int sm;
int score;
} student[100001];
int n,i,j,k,m;
scanf("%d",&n);
for(i=1;i<=n;i++) {scanf("%d %d %d",&student[i].num,&student[i].sc,&student[i].sm);}
for(i=1;i<=n;i++) {student[i].score=(student[i].sc+student[i].sm);}
int x,y,z,r,s,t,a,b,d;
a=1;
b=1;
d=1;
for(i=n;i>=1;i--) if(student[i].score>=a) {a=student[i].score;x=i;}
for(i=n;i>=1;i--)
{
if((i!=x)&&(student[i].score>=b)) {b=student[i].score;y=i;}
}
for(i=n;i>=1;i--)
{
if((i!=x)&&(i!=y)&&(student[i].score>=d)) {d=student[i].score;z=i;}
}
printf("%d %d\n%d %d\n%d %d",student[x].num,student[x].score,student[y].num,student[y].score,student[z].num,student[z].score);
}
| 14 |
6,606 | struct s
{
int a;
int sc[2];
};
void main()
{
struct s st[100000];
int t=0,j=0,max=0,p[3]={-1,-1};
long n,i;
scanf("%ld",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&st[i].a,&st[i].sc[0],&st[i].sc[1]);
st[i].sc[0]=st[i].sc[0]+st[i].sc[1];
}
i=0;
while(t<3)
{
if(i<n&&i!=p[0]&&i!=p[1])
{
j=(st[i].sc[0]>max)? i:j;
max=(st[i].sc[0]>max)? st[i].sc[0]:max;
i++;
}
else if(i<n&&(i==p[0]||i==p[1]))
i++;
else if(i=n)
{
printf("%d %d\n",j+1,max);
p[t]=j;
t++;
j=0;
max=0;
i=0;
}
}
} | 14 |
6,607 | struct student
{
int id;
int math;
int chinese;
int zongfen;
};
main()
{
int n,i=1,j;
int a[100001];
struct student stu[100001];
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d %d %d",&stu[i].id,&stu[i].math,&stu[i].chinese);
stu[i].zongfen=stu[i].math+stu[i].chinese;
if (i<4)
j=i;
else
j=4;
{
for(;j>1&&stu[i].zongfen>stu[a[j-1]].zongfen;j--)
a[j]=a[j-1];
}
a[j]=i;
}
for(i=1;i<=3;i++)
printf("%d %d\n",stu[a[i]].id,stu[a[i]].zongfen);
getchar();
getchar();
scanf("%d",&n);
return 0;
}
| 14 |
6,608 | void main()
{
struct data
{
int number;
int chinese;
int math;
int total;
}student[100000],temp;
long n,i,j;
scanf("%ld",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&student[i].number,&student[i].chinese,&student[i].math);
student[i].total=student[i].chinese+student[i].math;
}
for(i=0;i<3;i++)
for(j=i+1;j<n;j++)
if(student[i].total<student[j].total)
{
temp.number=student[i].number;
temp.chinese=student[i].chinese;
temp.math=student[i].math;
temp.total=student[i].total;
student[i].number=student[j].number;
student[i].chinese=student[j].chinese;
student[i].math=student[j].math;
student[i].total=student[j].total;
student[j].number=temp.number;
student[j].chinese=temp.chinese;
student[j].math=temp.math;
student[j].total=temp.total;
}
for(i=0;i<3;i++)
printf("%d %d\n",student[i].number,student[i].total);
} | 14 |
6,609 | int cmp(const void *a,const void *b)
{
return(*(int*)a-*(int*)b);
}
int main()
{
struct student
{
int num;
int chinese;
int maths;
int amount;
};
struct student stu[100000];
int a[100000],n,l,j,k;
scanf("%d",&n);
for (int i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].chinese,&stu[i].maths);
a[i]=stu[i].chinese+stu[i].maths;
}
qsort(a,n,sizeof(a[0]),cmp);
for(int h=n-1;h>=0;h--)
{
if (a[n-1]==stu[h].chinese+stu[h].maths)
{l=stu[h].num;}
}
for(int g=n-1;g>=0;g--)
{
if (a[n-2]==stu[g].chinese+stu[g].maths&&(g+1)!=l)
{j=stu[g].num;}
}
for(int f=n-1;f>=0;f--)
{
if (a[n-3]==stu[f].chinese+stu[f].maths&&(f+1)!=j&&(f+1)!=l)
{k=stu[f].num;}
}
printf("%d %d\n",l,a[n-1]);
printf("%d %d\n",j,a[n-2]);
printf("%d %d\n",k,a[n-3]);
} | 14 |
6,610 |
int main(int argc, char* argv[])
{
int n,num,math,china,z,i;
int num1=2,num2=1,num3=0,m1=0,m2=0,m3=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&num);
scanf("%d",&math);
scanf("%d",&china);
z=math+china;
if(z>num3)
{
num1=num2;
m1=m2;
num2=num3;
m2=m3;
num3=z;
m3=i;
}
else if(z>num2)
{
num1=num2;
m1=m2;
num2=z;
m2=i;
}
else if(z>num1)
{
num1=z;
m1=i;
}
}
printf("%ld %ld\n",m3,num3);
printf("%ld %ld\n",m2,num2);
printf("%ld %ld\n",m1,num1);
return 0;
}
| 14 |
6,611 | struct student
{
int num;
int yw;
int sx;
int zong;
}stu[100001];
int main(int argc, char* argv[])
{
int i,n,max1=0,max2=0,max3=0,fir,sec,thi;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d %d %d",&stu[i].num,&stu[i].yw,&stu[i].sx);
stu[i].zong=stu[i].yw+stu[i].sx;
if(stu[i].zong>max1){
max3=max2;
thi=sec;
max2=max1;
sec=fir;
max1=stu[i].zong;
fir=i;
}else if(stu[i].zong>max2){
max3=max2;
thi=sec;
max2=stu[i].zong;
sec=i;
}else if(stu[i].zong>max3){
max3=stu[i].zong;
thi=i;
}
}
printf("%d %d\n",stu[fir].num,stu[fir].zong);
printf("%d %d\n",stu[sec].num,stu[sec].zong);
printf("%d %d\n",stu[thi].num,stu[thi].zong);
return 0;
}
| 14 |
6,612 | int main()
{
int num[3],sum[3];
int i,j,k,t,n,m;
num[0]=num[1]=num[2]=sum[0]=sum[1]=sum[2]=-10000000;
scanf("%d",&n);
for(m=0;m<n;m++)
{
scanf("%d%d%d",&i,&j,&k);
j+=k;
if(sum[2]<j)
{
sum[2]=j;
num[2]=i;
if(sum[2]>sum[1])
{
t=sum[2];
sum[2]=sum[1];
sum[1]=t;
t=num[2];
num[2]=num[1];
num[1]=t;
if(sum[1]>sum[0])
{
t=sum[0];
sum[0]=sum[1];
sum[1]=t;
t=num[0];
num[0]=num[1];
num[1]=t;
}
}
}
}
for(i=0;i<3;i++)
printf("%d %d\n",num[i],sum[i]);
return 0;
} | 14 |
6,613 | /*
* ???: 1000010191_38_1.cpp
* ??: ???
* ????: 2010-12-31
* ??: ????????
*/
struct student //??
{
int id; //??
int x,y; //???????
int s; //??
} d[100001],t;
int main()
{
//????
int n;
cin>>n;
for (int i=1;i<=n;i++)
{
cin>>d[i].id>>d[i].x>>d[i].y;
//???
d[i].s=d[i].x+d[i].y;
}
//??
for (int i=1;i<=3;i++)
for (int j=1;j<=n-i;j++)
if (d[j].s>=d[j+1].s)
{
t=d[j];
d[j]=d[j+1];
d[j+1]=t;
}
//????
for (int i=n;i>=n-2;i--)
cout<<d[i].id<<' '<<d[i].s<<endl;
return 0;
}
| 14 |
6,614 |
//??????????????????????
int main()
{
struct s
{
int id;
int ch;
int ma;
}s;
long int n;
int i=0,j,zong,c=0;
int a[3]={0},b[3]={0};
int t;
scanf("%d",&n);
for(i=0;i<3;i++)
{
scanf("%d %d %d",&s.id,&s.ch,&s.ma);
a[i]=i+1;
b[i]=s.ma+s.ch;
}
for(i=0;i<2;i++)
{
if(b[i]>b[1+i])
{
t=b[i];b[i]=b[i+1];b[i+1]=t;
t=a[i];a[i]=a[i+1];a[i+1]=t;
}
}
for(i=3;i<n;i++)
{
scanf("%d %d %d",&s.id,&s.ch,&s.ma);
zong= s.ch+s.ma;
for(j=0;j<3;j++)
{
if(zong>b[j])c++;
}
if(c==1)
{
a[0]=s.id;
b[0]=zong;
}
if(c==2)
{
a[0]=a[1];
b[0]=b[1];
a[1]=s.id;
b[1]=zong;
}
if(c==3)
{
a[0]=a[1];
a[1]=a[2];
a[2]=s.id;
b[0]=b[1];
b[1]=b[2];
b[2]=zong;
}
c=0;
}
for(i=2;i>=0;i--)
{
printf("%d %d\n",a[i],b[i]);
}
} | 14 |
6,615 | int main()
{
struct student
{int ID;
int YW;
int SX;
};
struct student stu[100000];
int ZF[100000];
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&stu[i].ID);
scanf("%d",&stu[i].YW);
scanf("%d",&stu[i].SX);
ZF[i]=stu[i].YW+stu[i].SX;
}
int a=0,b=0,c=0,A=0,B=0,C=0;
for(int i=0;i<n;i++)
{
if(ZF[i]>a)
{
c=b;C=B;b=a;B=A;a=ZF[i];A=i;}
else if(ZF[i]>b)
{c=b;C=B;b=ZF[i];B=i;}
else if(ZF[i]>c)
{c=ZF[i];C=i;}
}
printf("%d %d\n",stu[A].ID,a);
printf("%d %d\n",stu[B].ID,b);
printf("%d %d\n",stu[C].ID,c);
getchar();
getchar();
}
| 14 |
6,616 | 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<n-1;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<n;i++)printf("%d %d\n",form[i].num,form[i].sum);
return 0;} | 14 |
6,617 |
int main(){
int n;
scanf("%d",&n);
struct score{
int id;
int yw;
int sx;
} stu [100000];
int i,j;
for(i=0;i<n;i++){
scanf("%d%d%d",&stu[i].id,&stu[i].yw,&stu[i].sx);
}
for(j=1;j<=3;j++){
int e,max=0;
for(i=0;i<=n-j;i++){
if((stu[i].yw+stu[i].sx)>(stu[max].yw+stu[max].sx)){
max=i;
}
}
if(max!=n-j){
e=stu[max].yw;
stu[max].yw=stu[n-j].yw;
stu[n-j].yw=e;
e=stu[max].sx;
stu[max].sx=stu[n-j].sx;
stu[n-j].sx=e;
e=stu[max].id;
stu[max].id=stu[n-j].id;
stu[n-j].id=e;
}
}
for(i=n-1;i>=n-2;i--){
printf("%d %d\n",(stu[i].id),(stu[i].yw+stu[i].sx));
}
printf("%d %d",(stu[n-3].id),(stu[n-3].yw+stu[n-3].sx));
return 0;
} | 14 |
6,618 | int main ()
{
struct student
{
int num;
int ch;
int ma;
int sum;
};
struct student *p;
int n, i, j, t1, t2, a1=0, a2=0, a3=0, k1, k2, k3;
scanf ("%d", &n);
p=(struct student *)malloc (n*sizeof (struct student));
for (i=0; i<n; i++)
{ scanf ("%d%d%d", &p[i].num, &p[i].ch, &p[i].ma);
p[i].sum= p[i].ch+p[i].ma; }
/*for (j=0; j<n-1; j++)
for (i=0; i<n-1-j; i++)
if (p[i].sum<p[i+1].sum)
{ t1=p[i].num; p[i].num=p[i+1].num; p[i+1].num=t1;
t2=p[i].sum; p[i].sum=p[i+1].sum; p[i+1].sum=t2; }*/
for (i=0; i<n; i++)
if (p[i].sum>a1) { k1=i; a1=p[i].sum; }
for (i=0; i<n; i++)
if (p[i].sum<=a1 && p[i].sum>a2 && i!=k1) { k2=i; a2=p[i].sum; }
for (i=0; i<n; i++)
if (p[i].sum<=a2 && p[i].sum>a3 && i!=k1 && i!=k2) { k3=i; a3=p[i].sum; }
printf ("%d %d\n%d %d\n%d %d\n", p[k1].num, p[k1].sum, p[k2].num, p[k2].sum, p[k3].num, p[k3].sum);
/*for (i=0; i<3; i++)
printf ("%d %d\n", p[i].num, p[i].sum);*/
return 0;
} | 14 |
6,619 | struct student
{
int num;
int chi;
int math;
int add;
struct student *next;
};
//struct student*creat()
//{
// struct student*p1,*p2,*head;
// int i=0;
// p1=p2=(struct student *)malloc(LEN);
//
// head=NULL;
// i=i+1;
void main()
{
int n,i;
scanf("%d",&n);
struct student *p1,*p2,*head;
head=p1=p2=(struct student *)malloc(LEN);
scanf("%d%d%d",&p1->num,&p1->chi,&p1->math);
p1->add=p1->chi+p1->math;
for(i=1;i<n-1;i++)
{
p1=(struct student *)malloc(LEN);
scanf("%d%d%d",&p1->num,&p1->chi,&p1->math);
p1->add=p1->chi+p1->math;
p2->next=p1;
p2=p1;
}
scanf("%d%d%d",&p1->num,&p1->chi,&p1->math);
p1->add=p1->chi+p1->math;
p1->next=NULL;
// printf("%d\n",p1->add);
for(i=0;i<3;i++)
{
p1=head;
int max=p1->add;
int *pp=&p1->num;
int *pp1=&p1->add;
while(p1->next)
{
p1=p1->next;
if(p1->add>max)
{
max=p1->add;
pp=&p1->num;
pp1=&p1->add;
}
}
// if(p2->add>max)
// {
// max=p2->add;
// pp=&p2->num;
// pp1=&p2->add;
// }
printf("%d %d\n",*pp,max);
*pp1=0;
}
}
| 14 |
6,620 |
typedef struct S{
int ID;
int c;
int m;
int a;
}S;
int mycmp(const void*e1,const void*e2){
return ((S*)e2)->a - ((S*)e1)->a;
}
void main()
{
struct S stu[100010];
int i,j,n;
scanf("%d",&n);
for (i = 0;i < n;i++){
scanf("%d%d%d",&(stu + i)->ID,&(stu + i)->c,&(stu + i)->m);
(stu + i)->a = (stu + i)->c + (stu + i)->m;
}
qsort(stu,n,sizeof(*(stu)),mycmp);
for (i = 0;i <= 2;i++)
printf("%d %d\n",(stu + i)->ID,(stu + i)->a);
} | 14 |
6,621 | void main()
{
int mat,chi,i,num;
struct stu{
int id;
int to;
}s[100001],temp1,temp2,max1,max2,max3;
scanf("%d",&num);
for(i=0;i<num;i++){
scanf("%d %d %d",&s[i].id,&chi,&mat);
s[i].to=chi+mat;
}
if(s[0].to>s[1].to&&s[1].to>s[2].to){max1=s[0];max2=s[1];max3=s[2];}
else if(s[2].to>s[0].to&&s[0].to>s[1].to){max1=s[2];max2=s[0];max3=s[1];}
else if(s[0].to>s[2].to&&s[2].to>s[1].to){max1=s[0];max2=s[2];max3=s[1];}
else if(s[2].to>s[1].to&&s[1].to>s[0].to){max1=s[2];max2=s[1];max3=s[0];}
else if(s[1].to>s[0].to&&s[0].to>s[2].to){max1=s[1];max2=s[0];max3=s[2];}
else {max1=s[1];max2=s[2];max3=s[0];}
for(i=0;i<num-1;i++){
if(s[i].to>max1.to){
temp1=max1;
temp2=max2;
max1=s[i];
max2=temp1;
max3=temp2;
}
else if(s[i].to>max2.to&&s[i].id!=max1.id){
temp1=max2;
max2=s[i];
max3=temp1;
}
else if(s[i].to>max3.to&&s[i].id!=max2.id&&s[i].id!=max1.id)max3=s[i];
}
printf("%d %d\n%d %d\n%d %d\n",max1.id,max1.to,max2.id,max2.to,max3.id,max3.to);
}
| 14 |
6,622 |
struct student{
int num;
int chin;
int math;
int sum;
}tem_stu;
int main()
{
int n,i;
scanf("%d",&n);
struct student *stu;
stu=(struct student*)malloc(n*sizeof(int)*4);
for(i=0;i<n;i++){
scanf("%d%d%d",&stu[i].num,&stu[i].chin,&stu[i].math);
stu[i].sum=stu[i].chin+stu[i].math;
}
int j;
for(j=1;j<4;j++){
for(i=0;i<n-j;i++){
if(stu[i].sum>=stu[i+1].sum){
tem_stu=stu[i+1];
stu[i+1]=stu[i];
stu[i]=tem_stu;
}
}
}
printf("%d %d\n",stu[n-1].num,stu[n-1].sum);
printf("%d %d\n",stu[n-2].num,stu[n-2].sum);
printf("%d %d\n",stu[n-3].num,stu[n-3].sum);
free(stu);
return 0;
}
| 14 |
6,623 | struct student
{
int num;
int yuwen;
int shuxue;
};
int main()
{
int n,m,i,j,t,k;
scanf("%d",&n);
m=n;
struct student *stu=(struct student*)malloc(sizeof(struct student)*n);
int *score=(int*)malloc(sizeof(int)*m);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].yuwen,&stu[i].shuxue);
score[i]=stu[i].yuwen+stu[i].shuxue;
}
for(i=0;i<3;i++)
{
for(j=0;j<m-1-i;j++)
{
if(score[j]>=score[j+1])
{
t=score[j];
score[j]=score[j+1];
score[j+1]=t;
k=stu[j].num;
stu[j].num=stu[j+1].num;
stu[j+1].num=k;
}
}
}
for(i=n-1;i>=n-3;i--)
{
printf("%d %d\n",stu[i].num,score[i]);
}
free(stu);
free(score);
return 0;
} | 14 |
6,624 | int main(int argc, char* argv[])
{
int n,*x,*y,*s,*z,i,j,o=0,t=0;
scanf("%d",&n);
x=(int*)malloc(sizeof(int)*n);
y=(int*)malloc(sizeof(int)*n);
s=(int*)malloc(sizeof(int)*n);
z=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&x[i],&y[i],&s[i]);
z[i]=y[i]+s[i];
}
for(j=0;j<3;j++)
{
for(i=0;i<n-1;i++)
{
if(z[i]>=z[i+1])
{
o=z[i];
z[i]=z[i+1];
z[i+1]=o;
t=x[i];
x[i]=x[i+1];
x[i+1]=t;
}
}
}
printf("%d %d\n",x[n-1],z[n-1]);
printf("%d %d\n",x[n-2],z[n-2]);
printf("%d %d\n",x[n-3],z[n-3]);
return 0;
}
| 14 |
6,625 |
typedef struct
{
int ID;
int chinese;
int math;
int sum;
}Student;
Student topThree[3];
int studentNum;
void initialise()
{
for(int i = 0; i < 3; i ++)
{
topThree[i].sum = -1;
}
}
void updateTopThree(Student stu)
{
for(int i = 0; i < 3; i ++)
{
if(stu.sum > topThree[i].sum)
{
for(int j = 2; j > i; j --)
{
topThree[j] = topThree[j-1];
}
topThree[i] = stu;
break;
}
}
}
void getStudentData()
{
Student temp;
scanf("%d", &studentNum);
for(int i = 0; i < studentNum; i ++)
{
scanf("%d %d %d", &temp.ID, &temp.chinese, &temp.math);
temp.sum = temp.chinese + temp.math;
updateTopThree(temp);
}
}
void printStudentData()
{
for(int i = 0; i < 3 && i < studentNum; i ++)
{
printf("%d %d\n", topThree[i].ID, topThree[i].sum);
}
}
int main()
{
initialise();
getStudentData();
printStudentData();
return 0;
}
| 14 |
6,626 | int main()
{
int i,n,math,chinese,std_num;
int first,second,third;
int score[3]={-1,-1,-1};
scanf("%d",&n);
first=0;second=0;third=0;
for(i=0;i<n;i++){
scanf("%d",&std_num);
scanf("%d",&chinese);
scanf("%d",&math);
if (chinese+math>score[0]){
third =second;
second=first;
score[2]=score[1];
score[1]=score[0];
first = std_num;
score[0]=chinese+math;
}
else if(chinese+math>score[1]){
third=second;
score[2]=score[1];
second=std_num;
score[1]=math+chinese;
}
else if(chinese+math>score[2]){
third=std_num;
score[2]=math+chinese;
}
}
printf("%d %d\n",first,score[0]);
printf("%d %d\n",second,score[1]);
printf("%d %d\n",third,score[2]);
return 0;
}
| 14 |
6,627 | int main(int argc, char* argv[])
{
struct student{
int ID,Ch,Ma;
}temp;
int fID=0,fG=0,sID=0,sG=0,tID=0,tG=0;
int n;
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
int sum=0;
scanf("%d%d%d",&temp.ID,&temp.Ch,&temp.Ma);
sum=temp.Ch+temp.Ma;
if(sum==fG)
{
tG=sG;
tID=sID;
sG=sum;
sID=temp.ID;
}
if(sum>fG)
{
tG=sG;
tID=sID;
sG=fG;
sID=fID;
fG=sum;
fID=temp.ID;
}
if(sum<fG&&sum>sG)
{
tG=sG;
tID=sID;
sG=sum;
sID=temp.ID;
}
if(sum<sG&&sum>tG)
{
tG=sum;
tID=temp.ID;
}
}
printf("%d %d\n",fID,fG);
printf("%d %d\n",sID,sG);
printf("%d %d\n",tID,tG);
return 0;
} | 14 |
6,628 | void main()
{
int n;
scanf("%d",&n);
struct student
{
int num;
int score_1;
int score_2;
int sum;
};
struct student stu[n];
int i,j,t;
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].score_1,&stu[i].score_2);
stu[i].sum=stu[i].score_1+stu[i].score_2;
}
for(j=0;j<=2;j++)
{
for(i=n-1;i>0+j;i--)
if(stu[i].sum>stu[i-1].sum)
{
t=stu[i].sum,stu[i].sum=stu[i-1].sum,stu[i-1].sum=t;
t=stu[i].num,stu[i].num=stu[i-1].num,stu[i-1].num=t;
}
}
for(i=0;i<=2;i++)
printf("%d %d\n",stu[i].num,stu[i].sum);
} | 14 |
6,629 | void main()
{
int i,j,n,k;
struct student
{
int num;
int score1;
int score2;
int t;
}stu[100000],m1,m2,m3;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d\n",&stu[i].num,&stu[i].score1,&stu[i].score2);
stu[i].t=stu[i].score1+stu[i].score2;
}
m1=stu[0];
m2=stu[0];
m3=stu[0];
for(i=0;i<n;i++)
{
if(stu[i].t>m1.t)
{
m3=m2;
m2=m1;
m1=stu[i];
}
else if(stu[i].t>m2.t&&stu[i].t<=m1.t)
{
m3=m2;
m2=stu[i];
}
else if(stu[i].t>m3.t&&stu[i].t<=m2.t)
{
m3=stu[i];
}
}
printf("%d %d\n%d %d\n%d %d",m1.num,m1.t,m2.num,m2.t,m3.num,m3.t);
}
| 14 |
6,630 |
int main(){
struct student{ //????student
int StudentNumber; //??
int ChineseGrades; //????
int MathGrades; //????
int Total; //???
};
struct student Stu[100000],sTemp; //??????Stu?sTemp
int n,i,j; //n??????i?j?????
cin>>n; //??????
for (i=0;i<=n-1;i++){ //????????????????????????
cin>>Stu[i].StudentNumber>>Stu[i].ChineseGrades>>Stu[i].MathGrades;
Stu[i].Total=Stu[i].ChineseGrades+Stu[i].MathGrades;
}
for (i=0;i<=2;i++){ //?????????????????????
for (j=n-1;j>=i+1;j--){
if (Stu[j].Total>Stu[j-1].Total){
sTemp=Stu[j];
Stu[j]=Stu[j-1];
Stu[j-1]=sTemp;
}
}
}
cout<<Stu[0].StudentNumber<<" "<<Stu[0].Total; //?????
for (i=1;i<=2;i++){
cout<<endl;
cout<<Stu[i].StudentNumber<<" "<<Stu[i].Total;
}
return 0;
}
| 14 |
6,631 | main()
{ int n,i;
struct h
{
int mun;
int chinese;
int math;
struct h *p;
} ;
struct h *a,*b,*lily;
scanf("%d",&n);
a=len;
lily=a;
for(i=0;i<n;i++)
{ scanf("%d %d %d",&a->mun,&a->chinese,&a->math);
b=len;
a->p=b;
a=b;
}
b=NULL;
a=lily;
int a1=0,a2=0,a3=0,b1=0,b2=0,b3=0,c;
for(i=0;i<n;i++)
{ c=(a->chinese+a->math);
if(c>a1){b3=b2;b2=b1;b1=a->mun;a3=a2;a2=a1;a1=c;}
else if(c>a2){b3=b2;b2=a->mun;a3=a2;a2=c;}
else if(c>a3){b3=a->mun;a3=c;}
a=a->p;
}
printf("%d %d\n",b1,a1);
printf("%d %d\n",b2,a2);
printf("%d %d\n",b3,a3);
} | 14 |
6,632 |
// ??????????
struct record
{
int stuID;
short YuWen;
short math;
short total;
};
struct YyxNode
{
struct record m_rec;
struct YyxNode *next;
};
struct YyxLink
{
int n;
struct YyxNode *head;
struct YyxNode *tail;
};
struct YyxLink *CreateNewLink()
{
struct YyxLink *newLn;
if((newLn=(struct YyxLink*)malloc(sizeof(struct YyxLink)))==NULL){
printf("Error: memory out! (1)\n");
exit(-1);
}
newLn->n = 0;
newLn->head = NULL;
newLn->tail = NULL;
return newLn;
}
struct YyxLink *AddNode(struct YyxLink *ln, const struct record *rec)
{
struct YyxNode *newNode;
if((newNode=(struct YyxNode*)malloc(sizeof(struct YyxNode)))==NULL){
printf("Error: memory out! (2)\n");
exit(-1);
}
newNode->m_rec = *rec;
newNode->next = NULL;
if(ln->n==0){
ln->head = newNode;
ln->tail = newNode;
}else{
ln->tail->next = newNode;
ln->tail = newNode;
}
ln->n ++;
return ln;
}
int myCompare(const struct record *rec1, const struct record *rec2)
{
return rec2->total - rec1->total;
}
struct YyxNode *Search(struct YyxLink *ln, const struct record *rec)
{
struct YyxNode *nd = ln->head;
while(nd!=NULL && myCompare(&nd->m_rec, rec))
nd = nd->next;
return nd;
}
struct YyxLink *ClearLink(struct YyxLink *ln)
{
struct YyxNode *delNode = ln->head;
struct YyxNode *nextNode;
while(delNode != NULL){
nextNode = delNode->next;
free(delNode);
delNode = nextNode;
}
ln->n = 0;
ln->head = NULL;
ln->tail = NULL;
return ln;
}
int main()
{
struct YyxLink *mainLn;
struct record stu;
int n;
int i;
struct record *max1, *max2, *max3;
struct YyxNode *temp;
mainLn = CreateNewLink();
scanf("%d", &n);
for(i=0; i<n; i++){
scanf("%d %d %d", &stu.stuID,
&stu.YuWen, &stu.math);
stu.total = stu.YuWen + stu.math;
AddNode(mainLn, &stu);
}
max1=max2=max3= &mainLn->head->m_rec;
temp = mainLn->head;
while(temp!=NULL){
if(max1->total<temp->m_rec.total)
max1 = &temp->m_rec;
temp = temp->next;
}
temp = mainLn->head;
if (max2==max1){
temp = mainLn->head->next;
max2 = &temp->m_rec;
}
while(temp!=NULL){
if(max2->total<temp->m_rec.total)
if(max1!=&temp->m_rec)
max2 = &temp->m_rec;
temp = temp->next;
}
temp = mainLn->head;
while(&temp->m_rec==max1||&temp->m_rec==max2)
temp = temp->next;
max3 = &temp->m_rec;
while(temp!=NULL){
if(max3->total<temp->m_rec.total)
if(max1!=&temp->m_rec&&max2!=&temp->m_rec)
max3 = &temp->m_rec;
temp = temp->next;
}
printf("%d %d\n", max1->stuID, max1->total);
printf("%d %d\n", max2->stuID, max2->total);
printf("%d %d\n", max3->stuID, max3->total);
// getchar();getchar();getchar();
free(ClearLink(mainLn));
return 0;
}
| 14 |
6,633 | int main()
{
int i,n;
struct{
int id,chi,math,sum;
} s,s1,s2,s3;
s1.sum=s2.sum=s3.sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&s.id,&s.chi,&s.math);
s.sum=s.chi+s.math;
if(s.sum>s1.sum)
{
s3=s2;s2=s1;s1=s;
}
else if(s.sum>s2.sum)
{
s3=s2,s2=s;
}
else if(s.sum>s3.sum)
{
s3=s;
}
}
printf("%d %d\n%d %d\n%d %d\n",s1.id,s1.sum,s2.id,s2.sum,s3.id,s3.sum);
getchar();
getchar();
getchar();
return 0;
}
| 14 |
6,634 | struct stu
{
int id;
int Chinese;
int math;
}a[100000];
void main()
{
int n,i,first,second,third,h1=0,h2=0,h3=0,e;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a[i].id,&a[i].Chinese,&a[i].math);
}
first=0;
second=0;
third=0;
for(i=0;i<n;i++)
{
if(first<(a[i].Chinese+a[i].math))
{
third=second;
h3=h2;
second=first;
h2=h1;
first=a[i].Chinese+a[i].math;
h1=a[i].id;
}
else if(first==(a[i].Chinese+a[i].math)&&first>second)
{
third=second;
h3=h2;
h2=a[i].id;
second=a[i].Chinese+a[i].math;
}
else if(first==(a[i].Chinese+a[i].math)&&first==second&&second>third)
{
third=a[i].Chinese+a[i].math;
h3=a[i].id;
}
else if(first>(a[i].Chinese+a[i].math)&&second<(a[i].Chinese+a[i].math))
{
third=second;
h3=h2;
second=a[i].Chinese+a[i].math;
h2=a[i].id;
}
else if(second>(a[i].Chinese+a[i].math)&&third<(a[i].Chinese+a[i].math))
{
third=a[i].Chinese+a[i].math;
h3=a[i].id;
}
}
printf("%d %d\n%d %d\n%d %d",h1,first,h2,second,h3,third);
} | 14 |
6,635 | int main(int argc, char* argv[])
{
struct r{int a;int b;int c;}r[99999];
int i,n,x=0,y=0,z=0,m1=0,m2=0,m3=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&r[i].a,&r[i].b,&r[i].c);
}
for(i=1;i<=n;i++)
{
if(r[i].b+r[i].c>m1)
{
m1=r[i].b+r[i].c;
x=i;
}
}
for(i=1;i<=n;i++)
{
if((r[i].b+r[i].c==m1)&&(i!=x))
{
m2=r[i].b+r[i].c;
y=i;
}
else if((m1>r[i].b+r[i].c)&&(r[i].b+r[i].c>m2))
{
m2=r[i].b+r[i].c;
y=i;
}
}
for(i=1;i<=n;i++)
{
if((r[i].b+r[i].c==m2)&&(i!=y)&&(i!=x))
{
m3=r[i].b+r[i].c;
z=i;
}
else if((m2>r[i].b+r[i].c)&&(r[i].b+r[i].c>m3))
{
m3=r[i].b+r[i].c;
z=i;
}
}
printf("%d %d\n",x,m1);
printf("%d %d\n",y,m2);
printf("%d %d\n",z,m3);
return 0;
}
| 14 |
6,636 | struct stu
{
int num,yu,shu,sum;
} ;
void main()
{
int n,i;
struct stu a[4];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d%d%d",&a[0].num,&a[0].yu,&a[0].shu);
a[0].sum=a[0].yu+a[0].shu;
if (a[0].sum>a[1].sum)
{
a[3].sum=a[2].sum;
a[3].num=a[2].num;
a[2].sum=a[1].sum;
a[2].num=a[1].num;
a[1].sum=a[0].sum;
a[1].num=a[0].num;
}else
if (a[0].sum>a[2].sum)
{
a[3].sum=a[2].sum;
a[3].num=a[2].num;
a[2].sum=a[0].sum;
a[2].num=a[0].num;
}
else if (a[0].sum>a[3].sum)
{
a[3].sum=a[0].sum;
a[3].num=a[0].num;
}
}
for (i=1;i<=3;i++)
printf("%d %d\n",a[i].num,a[i].sum);
} | 14 |
6,637 | struct inf
{
int nu;
int b;
int c;
int sum;
} a[100010],tmp;
int main()
{
int n,i,j,k,tmp1,tmp2;
char c;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
a[i-1].sum=0;
scanf("%d%d%d",&a[i-1].nu,&a[i-1].b,&a[i-1].c);
a[i-1].sum=a[i-1].b+a[i-1].c;
}
for(i=0;i<3;i++)
{
tmp1=i;tmp2=a[i].sum;
for(j=i+1;j<n;j++)
{
if(a[j].sum>tmp2)
{
tmp2=a[j].sum;
tmp1=j;
}
}
tmp=a[i];
a[i]=a[tmp1];
a[tmp1]=tmp;
}
for(i=0;i<3;i++)
printf("%d %d\n",a[i].nu,a[i].sum);
return 0;
}
| 14 |
6,638 | struct Student
{
int Num;
int Chinese;
int Math;
int Sum;
};
int main()
{
int n,i,s;
scanf("%d",&n);
struct Student stu[n];
struct Student temp,*p=stu;
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[i].Num,&stu[i].Chinese,&stu[i].Math);
stu[i].Sum=stu[i].Chinese+stu[i].Math;
}
if(n==2)
{
if(stu[0].Sum >stu[1].Sum)
temp=stu[0];
stu[0]=stu[1];
stu[1]=temp;
printf("%d %d %d\n",stu[0].Num,stu[0].Chinese,stu[0].Math);
printf("%d %d %d\n",stu[1].Num,stu[1].Chinese,stu[1].Math);
}
else
{
for(i=0,s=0;i<n;i++)
if(stu[i].Sum>s)
s=stu[i].Sum;
for(i=0;i<n;i++)
{
if(stu[i].Sum==s)
{
printf("%d %d\n",stu[i].Num,stu[i].Sum);
stu[i].Sum=0;
break;
}
}
for(i=0,s=0;i<n;i++)
if(stu[i].Sum>s)
s=stu[i].Sum;
for(i=0;i<n;i++)
{
if(stu[i].Sum==s)
{
printf("%d %d\n",stu[i].Num,stu[i].Sum);
stu[i].Sum=0;
break;
}
}
for(i=0,s=0;i<n;i++)
if(stu[i].Sum>s)
s=stu[i].Sum;
for(i=0;i<n;i++)
{
if(stu[i].Sum==s)
{
printf("%d %d\n",stu[i].Num,stu[i].Sum);
stu[i].Sum=0;
break;
}
}
}
getchar();
getchar();
getchar();
} | 14 |
6,639 | struct student
{
int xuehao;
int yuwen;
int shuxue;
int zongfen;
}stu[100000];
int main(int argc, char* argv[])
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].xuehao,&stu[i].yuwen,&stu[i].shuxue);
stu[i].zongfen=stu[i].yuwen+stu[i].shuxue;
}
int max1=2,max2=1,max3=0,num1=0,num2=0,num3=0;
for(i=0;i<n;i++)
{
if(stu[i].zongfen>max1)
{
max3=max2;
num3=num2;
max2=max1;
num2=num1;
max1=stu[i].zongfen;
num1=i;
}else if(stu[i].zongfen<=max1&&stu[i].zongfen>max2)
{
max3=max2;
num3=num2;
max2=stu[i].zongfen;
num2=i;
}else if(stu[i].zongfen<=max2&&stu[i].zongfen>max3)
{
max3=stu[i].zongfen;
num3=i;
}
}
printf("%d %d\n",stu[num1].xuehao,stu[num1].zongfen);
printf("%d %d\n",stu[num2].xuehao,stu[num2].zongfen);
printf("%d %d\n",stu[num3].xuehao,stu[num3].zongfen);
return 0;
}
| 14 |
6,640 | struct student
{int id;
int yw;
int sx;
}stu[100000];
void main()
{
int n,i,sum[100000],temp[3],max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].id,&stu[i].yw,&stu[i].sx);
sum[i]=stu[i].yw+stu[i].sx;
}
for(i=0,max=-1,temp[0]=0;i<n;i++)
{
if(sum[i]>max)
{
max=sum[i];
temp[0]=i;
}
}
for(i=0,max=-1,temp[1]=0;i<n;i++)
{
if(i==temp[0])continue;
else
{
if(sum[i]>max)
{
max=sum[i];
temp[1]=i;
}
}
}
for(i=0,max=-1,temp[2]=0;i<n;i++)
{
if(i==temp[0]||i==temp[1])continue;
else
{
if(sum[i]>max)
{
max=sum[i];
temp[2]=i;
}
}
}
printf("%d %d\n",stu[temp[0]].id,sum[temp[0]]);
printf("%d %d\n",stu[temp[1]].id,sum[temp[1]]);
printf("%d %d",stu[temp[2]].id,sum[temp[2]]);
} | 14 |
6,641 | struct f{
int a;
int b;
int c;}st[100000],tp;
int main(){
int n,i,ii,j,d,a,b,c;
char cc;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d%d%d",&st[i].a,&st[i].b,&st[i].c);
st[i].b+=st[i].c;
}
for(i=1;i<=3;i++){
for(j=i+1;j<=n;j++){
if(st[j].b>st[i].b){
tp=st[i];
st[i]=st[j];
st[j]=tp;}}}
for(i=1;i<=3;i++)
printf("%d %d\n",st[i].a,st[i].b);
}
| 14 |
6,642 | struct student
{
int num;
int yuwen;
int shuxue;
int zongfen;
};
void main()
{
int n,i,j;
scanf("%d",&n);
struct student s[3],p,temp;
for(i=0;i<3;i++)
{
scanf("%d%d%d",&s[i].num,&s[i].yuwen,&s[i].shuxue);
s[i].zongfen=s[i].shuxue+s[i].yuwen;
}
for(i=0;i<2;i++)
{
for(j=0;j<2-i;j++)
{
if(s[j].zongfen<s[j+1].zongfen)
temp=s[j],s[j]=s[j+1],s[j+1]=temp;
}
}
for(i=3;i<n;i++)
{
scanf("%d%d%d",&p.num,&p.yuwen,&p.shuxue);
p.zongfen=p.shuxue+p.yuwen;
if(p.zongfen>s[2].zongfen&&p.zongfen<=s[1].zongfen)
s[2]=p;
else if(p.zongfen>s[1].zongfen&&p.zongfen<=s[0].zongfen)
s[2]=s[1],s[1]=p;
else if(p.zongfen>s[0].zongfen)
s[2]=s[1],s[1]=s[0],s[0]=p;
}
printf("%d %d\n%d %d\n%d %d",s[0].num,s[0].zongfen,s[1].num,s[1].zongfen,s[2].num,s[2].zongfen);
} | 14 |
6,643 | int main()
{
struct student
{
char NUM[100000];
int Ma;
int Ch;
}stu;
int n,i,x,max1,max2,max3,m1,m2,m3;
max1=max2=max3=0;
m1=m2=m3=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d",stu.NUM,&(stu.Ma),&(stu.Ch));
x=stu.Ma+stu.Ch;
if(x>max1)
{
max3=max2;
max2=max1;
max1=x;
m3=m2;
m2=m1;
m1=i;
}
else if(x==max1)
{
max3=max2;
max2=max1;
max1=max1;
m3=m2;
m2=i;
}
else if(x<max1 && x>max2)
{
max3=max2;
max2=x;
m3=m2;
}
else if(x==max2)
{
max3=max2;
m3=i;
}
else if(x<max2 && x>max3)
{
max3=x;
m3=i;
}
}
printf("%d %d\n",m1,max1);
printf("%d %d\n",m2,max2);
printf("%d %d\n",m3,max3);
return 0;
}
| 14 |
6,644 |
struct person
{
int num;
int chinese;
int math;
int total;
}student[110000];
int main()
{
int n, i, max1=0, count1=0, max2=0, count2=0, max3=0, count3=0, number=0, sum=0;
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%d", &student[i].num);
scanf("%d", &student[i].chinese);
scanf("%d", &student[i].math);
}
for(i=0; i<n; i++)
{
student[i].total=student[i].chinese+student[i].math;
}
for(i=n-1; i>=0; i--)
{
if(student[i].total>=max1)
{
max1=student[i].total;
count1=i;
}
}
number=student[0].num;
sum=student[0].total;
student[0].num=student[count1].num;
student[0].total=student[count1].total;
student[count1].num=number;
student[count1].total=sum;
number=0;
sum=0;
for(i=n-1; i>=1; i--)
{
if(student[i].total>=max2)
{
max2=student[i].total;
count2=i;
}
}
number=student[1].num;
sum=student[1].total;
student[1].num=student[count2].num;
student[1].total=student[count2].total;
student[count2].num=number;
student[count2].total=sum;
number=0;
sum=0;
for(i=n-1; i>=2; i--)
{
if(student[i].total>=max3)
{
max3=student[i].total;
count3=i;
}
}
number=student[2].num;
sum=student[2].total;
student[2].num=student[count3].num;
student[2].total=student[count3].total;
student[count3].num=number;
student[count3].total=sum;
for(i=0; i<3; i++)
{
printf("%d %d\n", student[i].num, student[i].total);
}
return 0;
} | 14 |
6,645 |
struct ace
{
char id[10];
int a;
int b;
}o[3],r;
void main()
{
int n,i,s[3],m,j,v;
char z[10];
scanf("%d",&n);
scanf("%s %d %d",o[0].id,&o[0].a,&o[0].b);
scanf("%s %d %d",o[1].id,&o[1].a,&o[1].b);
scanf("%s %d %d",o[2].id,&o[2].a,&o[2].b);
s[0]=o[0].a+o[0].b;
s[1]=o[1].a+o[1].b;
s[2]=o[2].a+o[2].b;
for(i=0;i<2;i++)
{
for(j=i+1;j<3;j++)
{
if(s[i]<s[j])
{
strcpy(z,o[i].id);
strcpy(o[i].id,o[j].id);
strcpy(o[j].id,z);
v=s[i];
s[i]=s[j];
s[j]=v;
}
}
}
for(i=0;i<n-3;i++)
{
scanf("%s %d %d",r.id,&r.a,&r.b);
m=r.a+r.b;
if(m>s[0] )
{o[2]=o[1];s[2]=s[1];o[1]=o[0];s[1]=s[0];o[0]=r;s[0]=m;}
else if(m<=s[0] && m>s[1])
{o[2]=o[1];s[2]=s[1];o[1]=r;s[1]=m;}
else if(m<=s[1] && m>s[2])
{o[2]=r;s[2]=m;}
}
printf("%s %d\n",o[0].id,s[0]);
printf("%s %d\n",o[1].id,s[1]);
printf("%s %d\n",o[2].id,s[2]);
}
| 14 |
6,646 | struct score
{int num;
int yuwen;
int shuxue;
int total;
struct score*next;
};
int n;
struct score*creat()
{struct score*p1,*p2,*head;
head=p2=(struct score*)malloc(len);
scanf("%d%d%d",&p2->num,&p2->yuwen,&p2->shuxue);
p2->total=p2->shuxue+p2->yuwen;
n--;
while(n--)
{p1=(struct score*)malloc(len);
scanf("%d%d%d",&p1->num,&p1->yuwen,&p1->shuxue);
p1->total=p1->shuxue+p1->yuwen;
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return head;
}
void search(struct score*head)
{struct score*p;int i,max;
for(i=0;i<3;i++)
{max=0;
p=head;
while(p!=NULL)
{
if(p->total>max)max=p->total;
p=p->next;
}
p=head;
while(p!=NULL)
{if(p->total==max)
{printf("%d %d\n",p->num,p->total);
p->total=0;
break;
}
p=p->next;
}
}
}
main()
{scanf("%d",&n);
struct score*head;
head=creat();
search(head);
} | 14 |
6,647 | struct student
{
int num;
int score1;
int score2;
int score;
};
void main()
{
int n;
scanf("%d",&n);
struct student stu[100000];
struct student *p,*p1,*t1,*t2,*t3;
int tem,tem1;
for(p=stu;p<stu+n;p++)
{
scanf("%d %d %d",&p->num,&p->score1,&p->score2);
p->score=p->score1+p->score2;
}
int max;
for(p=stu,t1=stu,max=stu->score;p<stu+n;p++)
{
if(p->score>max) {t1=p;max=p->score;}
}
for(p=stu,t2=stu,max=stu->score;p<stu+n;p++)
{
if(p==t1) continue;
if(p->score>max) {t2=p;max=p->score;}
}
for(p=stu,t3=stu,max=stu->score;p<stu+n;p++)
{
if((p==t1)||(p==t2)) continue;
if(p->score>max) {t3=p;max=p->score;}
}
printf("%d %d\n",t1->num,t1->score);
printf("%d %d\n",t2->num,t2->score);
printf("%d %d\n",t3->num,t3->score);
}
| 14 |
6,648 | void main()
{
int n,i,k,max,m,c;
int a[100000];
struct student
{ int num;
int math;
int b;
}stu1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu1.num,&stu1.math,&stu1.b);
a[i]=stu1.math+stu1.b;
}
max=a[0];
for(i=1;i<n;i++)
{
if(a[i]>max)
{max=a[i];
k=i;}
}
printf("%d %d\n",k+1,a[k]);
a[k]=0;
max=a[0];
for(i=1;i<n;i++)
{
if(a[i]>max)
{max=a[i];
m=i;}
}
printf("%d %d\n",m+1,a[m]);
a[m]=0;
max=a[0];
for(i=1;i<n;i++)
{
if(a[i]>max)
{max=a[i];
c=i;}
}
printf("%d %d",c+1,a[c]);
} | 14 |
6,649 |
int main()
{
int Student_Num;
cin>>Student_Num;
//??
struct A
{
int ID;
int chinese;
int math;
int total;
}student[100000+10],a[3];
//?????
for(int i=0;i<=Student_Num-1;i++)
{
cin>>student[i].ID;
cin>>student[i].chinese;
cin>>student[i].math;
student[i].total=student[i].math+student[i].chinese;
}
//????
a[0]=a[1]=a[2]=student[0];
for(int i=0;i<=Student_Num-1;i++)
{
if(student[i].total>a[0].total)a[0]=student[i];
}
for(int i=0;i<=Student_Num-1;i++)
{
if(student[i].total>a[1].total&&student[i].total<=a[0].total&&student[i].ID!=a[0].ID)a[1]=student[i];
}
for(int i=0;i<=Student_Num-1;i++)
{
if(student[i].total>a[2].total&&student[i].total<=a[1].total&&student[i].ID!=a[0].ID&&student[i].ID!=a[1].ID)a[2]=student[i];
}
//??
for(int i=0;i<=2;i++)
{
cout<<a[i].ID<<" "<<a[i].total<<endl;
}
//??
return 0;
} | 14 |
6,650 | struct student
{
int number;
int chinese;
int math;
int num;
}stu[100001];
int main ( )
{
int n, i, j, max[3][2] = {0};
cin >> n;
for(i = 0;i < n;i++)//??????????
{
cin >> stu[i].number >> stu[i].chinese >> stu[i].math;
stu[i].num = stu[i].chinese + stu[i].math;
}
for(j = 0;j < 3;j++)//??3??????
{
for(i = 0;i < n;i++)
{
if(stu[i].num > max[j][0])
{
max[j][0] = stu[i].num;
max[j][1] = i + 1;
}
}
stu[max[j][1]-1].num = 0;
}
for(j = 0;j < 3;j++)//?????
{
cout << max[j][1] << ' ' << max[j][0] << endl;
}
return 0;
} | 14 |
6,651 |
struct st
{int I;
int c;
int m;
}
st[100000];
int main()
{
int n,i,j,k=0,a,b;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d %d %d",&st[i].I,&st[i].c,&st[i].m);
}
for (i=0;i<3;i++)
{
for(j=0;j<n;j++)
{
if (k<st[j].c+st[j].m)
{
k=st[j].c+st[j].m;
a=st[j].I;
b=j;
}
}
st[b].c=0;
st[b].m=0;
printf("%d %d",a,k);
if (i<2)
printf("\n");
k=0;
}
}
| 14 |
6,652 |
struct Student
{
int number;
int a;
int b;
int c;
};
int main()
{
int n, i;
int x, y, z;
struct Student stu;
struct Student maxStu, smaxStu, tmaxStu;
scanf("%d",&n);
scanf("%d%d%d",&x,&y,&z);
stu.number = x;
stu.a = y;
stu.b = z;
stu.c = stu.a + stu.b;
maxStu = stu;
smaxStu = stu;
tmaxStu = stu;
for (i = 0; i < n-1; i++){
scanf("%d%d%d",&x,&y,&z);
stu.number = x;
stu.a = y;
stu.b = z;
stu.c = stu.a + stu.b;
if (stu.c > maxStu.c){
if (maxStu.c > smaxStu.c){
if (smaxStu.c > tmaxStu.c){
tmaxStu = smaxStu;
}
smaxStu = maxStu;
}
else if (maxStu.c > tmaxStu.c){
tmaxStu = maxStu;
}
maxStu = stu;
}
else if (stu.c > smaxStu.c){
if (smaxStu.c > tmaxStu.c){
tmaxStu = smaxStu;
}
smaxStu = stu;
}
else if (stu.c > tmaxStu.c){
tmaxStu = stu;
}
}
printf ("%d %d\n%d %d\n%d %d",maxStu.number,maxStu.c,smaxStu.number,smaxStu.c,tmaxStu.number,tmaxStu.c);
return 0;
} | 14 |
6,653 | void main()
{
struct student
{
int num,sum;
} stu[100000];
int n,i,j,t,chi,math;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&chi,&math);
stu[i].sum=chi+math;
}
for (i=0;i<3;i++)
{
for (j=n-1;j>i;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;
}
}
}
printf("%d %d\n",stu[0].num,stu[0].sum);
printf("%d %d\n",stu[1].num,stu[1].sum);
printf("%d %d",stu[2].num,stu[2].sum);
}
| 14 |
6,654 | struct student
{
int i;
int j;
int k;
};
main()
{
int n;
scanf("%d",&n);
struct student c[n+10];
int m1=1,m2=1,m3=1;
for(int m=1;m<=n;m++)
{ scanf("%d %d %d",&c[m].i,&c[m].j,&c[m].k);
if((c[m].j+c[m].k)>(c[m1].j+c[m1].k))
{m3=m2;m2=m1;m1=m;}
else if((c[m].j+c[m].k)>(c[m2].j+c[m2].k))
{ m3=m2;m2=m;}
else if((c[m].j+c[m].k)>(c[m3].j+c[m3].k))
m3=m;}
printf("%d %d\n",c[m1].i,c[m1].j+c[m1].k);
printf("%d %d\n",c[m2].i,c[m2].j+c[m2].k);
printf("%d %d\n",c[m3].i,c[m3].j+c[m3].k);
getchar();getchar();getchar();}
| 14 |
6,655 | int main(int argc, char* argv[])
{
int x,i,n,m=0,j=0,k=0,s,l1,l2,l3;
int a[100000],b[100000];
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d%d%d",&x,&(a[i]),&(b[i]));
s=a[i]+b[i];
if(s>m)
{
j=m;
m=s;
l2=l1;
l1=i;}
else if(s>j)
{
k=j;
j=s;
l3=l2;
l2=i;}
else if(s>k)
{ k=s;
l3=i;}
}
printf("%d %d\n",l1,m);
printf("%d %d\n",l2,j);
printf("%d %d\n",l3,k);
return 0;
}
| 14 |
6,656 | struct student
{int num;
int score1;
int score2;
} stu[100000];
void main()
{
int n,i,sum[100000],max=0,j,k,l;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d%d%d",&stu[i].num,&stu[i].score1,&stu[i].score2);
sum[i]=stu[i].score1+stu[i].score2;}
for(i=0;i<n;i++)
if(sum[i]>max){max=sum[i];j=i;}
max=0;
for(i=0;i<n;i++)
if(sum[i]>max&&i!=j){max=sum[i];k=i;}
max=0;
for(i=0;i<n;i++)
if(sum[i]>max&&i!=j&&i!=k){max=sum[i];l=i;}
printf("%d %d\n%d %d\n%d %d\n",stu[j].num,sum[j],stu[k].num,sum[k],stu[l].num,sum[l]);
} | 14 |
6,657 | /*
* 01.cpp
*
* Created on: 2010-12-24
* Author: liuquan
*/
int main(){
struct student{//????
int number;
int chinese;
int math;
int all;
}stu[100000];
int n,i,j,n1=1,n2=1,n3=1;
cin>>n;
for(i=1;i<=n;i++){//??
cin>>stu[i].number>>stu[i].chinese>>stu[i].math;
stu[i].all=stu[i].chinese+stu[i].math;
}
/*for(j=1;j<n;j++){//?????
for(i=1;i<n-j;i++){
if(stu[i].all<stu[i+1].all){
t=stu[i].all;
stu[i].all=stu[i+1].all;
stu[i+1].all=t;
t1=stu[i].number;
stu[i].number=stu[i+1].number;
stu[i+1].number=t1;
}
}
}*/
for(i=2;i<=n;i++){
if(stu[n1].all<stu[i].all)
n1=i;
}
for(i=2;i<=n;i++){
if(i==n1)
continue;
if(stu[n2].all<stu[i].all)
n2=i;
}
for(i=2;i<=n;i++){
if(i==n2||i==n1)
continue;
if(stu[n3].all<stu[i].all)
n3=i;
}
cout<<stu[n1].number<<" "<<stu[n1].all<<endl;//?????
cout<<stu[n2].number<<" "<<stu[n2].all<<endl;
cout<<stu[n3].number<<" "<<stu[n3].all<<endl;
return 0;
} | 14 |
6,658 | struct student{
int no;
int ch;
int math;
int sum;
struct student *next;
};
struct student *creat(long n)
{
long i;
struct student *head, *p,*q;
head=(struct student *)malloc(len);
p=(struct student *)malloc(len);
head->next=q=p;
scanf("%d %d %d",&p->no, &p->ch,&p->math);
p->sum=(p->ch)+(p->math);
for(i=1;i<n;i++)
{
p=(struct student *)malloc(len);
scanf("%d %d %d",&p->no, &p->ch,&p->math);
p->sum=(p->ch)+(p->math);
q->next=p;
q=p;
p->next=NULL;
}
// for(p=head->next;p!=NULL;p=p->next)printf("%d %d",p->no,p->sum);
return(head);
}
void sort(struct student *head)
{
struct student *p,*q1,*q2,*q3;
int m1,m2,m3;
for(p=head->next,m1=p->sum;p!=NULL;p=p->next)
if(p->sum>m1){m1=p->sum;q1=p;}
printf("%d %d\n",q1->no,q1->sum);
for(p=head->next,m2=p->sum;p!=NULL;p=p->next)
if(p->sum>m2 && p!=q1){m2=p->sum;q2=p;}
printf("%d %d\n",q2->no,q2->sum);
for(p=head->next,m3=p->sum;p!=NULL;p=p->next)
if(p->sum>m3 && p!=q1 && p!= q2){m3=p->sum;q3=p;}
printf("%d %d\n",q3->no,q3->sum);
}
int main()
{
long n;
struct student *head;
scanf("%d",&n);
head=creat(n);
sort(head);
return 0;
}
| 14 |
6,659 | struct student
{
int num;
int chi;
int math;
int total;
struct student *next;
};
struct student* creat(int n)
{
struct student *p1,*p2,*head;
int i;
p1=p2=(struct student*) malloc(len);
head=NULL;
i=0;
while(i<n)
{
scanf("%d %d %d",&p1->num,&p1->chi,&p1->math);
i=i+1;
if(i==1)
head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student*)malloc(len);
}
p2->next=NULL;
return(head);
}
void sum(struct student*head)
{
struct student*p1;
p1=head;
while(p1)
{
p1->total=p1->chi+p1->math;
p1=p1->next;
}
}
struct student* choose(struct student*head)
{
struct student*p1,*p2;
p1=head;
p2=p1;
while(p1->next)
{
if(p2->total<(p1->next)->total)
p2=p1->next;
p1=p1->next;
}
printf("%d %d\n",p2->num,p2->total);
return(p2);
}
struct student* del(struct student*head,struct student*p2)
{
struct student *p1;
p1=head;
if(p2==head)
{
head=p2->next;
return(head);
}
else
{
while(p1->next!=p2)
{
p1=p1->next;
}
p1->next=p2->next;
}
return(head);
}
void main()
{
struct student *head,*p;
int n;
scanf("%d",&n);
if(n>=3)
{
head=creat(n);
sum(head);
p=choose(head);
head=del(head,p);
p=choose(head);
head=del(head,p);
p=choose(head);
}
else if(n=2)
{
head=creat(n);
sum(head);
p=choose(head);
head=del(head,p);
p=choose(head);
}
else
{
head=creat(n);
sum(head);
p=choose(head);
}
}
| 14 |
6,660 | struct Student
{
int num;
int chn;
int mth;
int sum;
};
struct Scr
{
int num;
int sum;
};
int main()
{
struct Student stu[100000];
struct Scr scr[3];
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[i].num,&stu[i].chn,&stu[i].mth);
stu[i].sum=stu[i].chn+stu[i].mth;
}
scr[0].num=stu[0].num;
scr[0].num=stu[0].num;
for(i=1;i<n;i++)
{
if(stu[i].sum>scr[0].sum)
{
scr[0].num=stu[i].num;
scr[0].sum=stu[i].sum;
}
}
scr[1].num=stu[0].num;
scr[1].num=stu[0].num;
for(i=1;i<n;i++)
{
if(i!=scr[0].num-1)
{
if(stu[i].sum>scr[1].sum)
{
scr[1].num=stu[i].num;
scr[1].sum=stu[i].sum;
}
}
}
scr[2].num=stu[0].num;
scr[2].num=stu[0].num;
for(i=1;i<n;i++)
{
if(i==scr[0].num-1||i==scr[1].num-1)
continue;
else
{
if(stu[i].sum>scr[2].sum)
{
scr[2].num=stu[i].num;
scr[2].sum=stu[i].sum;
}
}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",scr[i].num,scr[i].sum);
}
return 0;
}
| 14 |
6,661 | struct student
{
int id;
int chinese;
int math;
}student[100000];
void main()
{
int n,i,j,sum[100000]={0},h1=0,h2=0,h3=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&student[i].id,&student[i].chinese,&student[i].math);
}
int first=0;
int sec=0;
int thi=0;
for(j=0;j<n;j++){
if(first<student[j].chinese+student[j].math)
{
thi=sec;
h3=h2;
sec=first;
h2=h1;
first=student[j].chinese+student[j].math;
h1=student[j].id;
}
else if((first>student[j].chinese+student[j].math)&&(sec<student[j].chinese+student[j].math))
{
thi=sec;
h3=h2;
sec=student[j].chinese+student[j].math;
h2=student[j].id;
}
else if((sec>student[j].chinese+student[j].math)&&(thi<student[j].chinese+student[j].math))
{
thi=student[j].chinese+student[j].math;
h3=student[j].id;
}
else if((first==student[j].chinese+student[j].math)&&(sec<student[j].chinese+student[j].math))
{
thi=sec;
h3=h2;
sec=student[j].chinese+student[j].math;
h2=student[j].id;
}
else if((sec==student[j].chinese+student[j].math)&&(thi<student[j].chinese+student[j].math))
{
thi=student[j].chinese+student[j].math;
h3=student[j].id;
}
}
printf("%d %d\n%d %d\n%d %d",h1,first,h2,sec,h3,thi);
}
| 14 |
6,662 |
int main()
{
int n,i,j,t,First=0,FirstNum,Second=0,SecondNum,Third=0,ThirdNum;
scanf("%d",&n);
struct Student
{
int Chinese;
int Math;
int Sum;
int Num;
}Student[n+1];
for (i=1;i<=n;i++)
{
scanf("%d %d %d",&Student[i].Num,&Student[i].Chinese,&Student[i].Math);
Student[i].Sum=Student[i].Chinese+Student[i].Math;
}
for (i=1;i<=n;i++)
{
if (Student[i].Sum>First)
{
First=Student[i].Sum;
FirstNum=i;
}
}
for (i=1;i<=n;i++)
{
if (Student[i].Sum>Second&&Student[i].Sum<=First&&i!=FirstNum)
{
Second=Student[i].Sum;
SecondNum=i;
}
}
for (i=1;i<=n;i++)
{
if (Student[i].Sum>Third&&Student[i].Sum<=Second&&i!=SecondNum&&i!=FirstNum)
{
Third=Student[i].Sum;
ThirdNum=i;
}
}
printf("%d %d\n",FirstNum,First);
printf("%d %d\n",SecondNum,Second);
printf("%d %d\n",ThirdNum,Third);
}
| 14 |
6,663 | struct student
{
int num;
int yuwen;
int math;
int total;
struct student *next;
};
long m,n;
struct student *creat(void)
{
struct student *head;
struct student *p1,*p2;
m=0;head=0;
while(m<n)
{
m=m+1;
p1=(struct student *)malloc(sizeof(struct student));
scanf("%d %d %d",&p1->num,&p1->yuwen,&p1->math);
p1->total=p1->yuwen+p1->math;
if(m==1){head=p1;p2=p1;}
else p2->next=p1;
p2=p1;
}
p2->next=0;
return(head);
}
void main()
{
struct student *head,*p,*px;
int a[3][2],t1,t2;
scanf("%ld",&n);
head=creat();
p=head;
a[0][1]=a[1][1]=a[2][1]=0;
if(head!=0)
do
{
if(p->total>a[2][1])
{a[2][1]=p->total;a[2][0]=p->num;}
if(a[2][1]>a[1][1])
{t1=a[1][1];a[1][1]=a[2][1];a[2][1]=t1;t2=a[1][0];a[1][0]=a[2][0];a[2][0]=t2;}
if(a[1][1]>a[0][1])
{t1=a[0][1];a[0][1]=a[1][1];a[1][1]=t1;t2=a[0][0];a[0][0]=a[1][0];a[1][0]=t2;}
p=p->next;
}
while(p!=0);
for(t1=0;t1<=2;t1++)
{
printf("%d %d\n",a[t1][0],a[t1][1]);
}
} | 14 |
6,664 |
int main()
{
int N,i,j,k;
cin>>N;
struct Student_Num //?????
{
int num; //??
int Chinese; //????
int Math; //????
};
struct Student_Num student[N]; //N??????
struct Student_Num temp;
for(i=0;i<N;i++)
{
cin>>student[i].num>>student[i].Chinese>>student[i].Math; //????????
}
int total[N],totalNum[3],p[3]; //?????????????????????????
for(i=0;i<N;i++)
{
total[i]=student[i].Chinese+student[i].Math; //???
}
for(i=0;i<3;i++) //????0
{
totalNum[i]=0;
}
for(i=0;i<3;i++) //?????
{
for(j=0;j<N;j++)
{
if(totalNum[i]<total[j])
{
totalNum[i]=total[j];
p[i]=j;
}
}
total[p[i]]=0; //?????????????????0???????????????
}
for(i=0;i<3;i++)
{
cout<<student[p[i]].num<<' '<<totalNum[i]<<endl; //????????
}
return 0;
} | 14 |
6,665 | long int n;
struct stu
{
long int num,chi,mat,tot;
};
int comp(const void *a , const void *b)
{
return ((struct stu*)b)->tot-((struct stu*)a)->tot;
}
struct stu a[100000],b;
int main()
{
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a[i].num,&a[i].chi,&a[i].mat);
a[i].tot=a[i].chi+a[i].mat;
}
qsort(a,n,sizeof(struct stu),comp);
for(i=0;i<3;i++)
printf("%d %d\n",a[i].num,a[i].tot);
return 0;
} | 14 |
6,666 | struct student
{
int id;
int chinese;
int math;
}stu[100000];
void bubble(struct student stu[],int n)
{
int pass,i;
struct student temp;
for(pass=n-1;pass>=n-3;pass--)
for(i=pass;i>0;i--)
if(stu[i].chinese+stu[i].math>stu[i-1].chinese+stu[i-1].math)
{
temp=stu[i];
stu[i]=stu[i-1];
stu[i-1]=temp;
}
}
int main()
{
struct student *p;
int i;
int n;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d",&stu[i].id,&stu[i].chinese,&stu[i].math);
bubble(stu,n);
for(p=stu;p<stu+3;p++)
printf("%d %d%c",p->id,p->chinese+p->math,(p==stu+n-1)?'\0':'\n');
return 0;
} | 14 |
6,667 | int pfCompare(const void * elem1, const void * elem2)
{
int c;
c=*(int*)elem1-*(int*)elem2;
return c;
}
struct student
{
int num;
int x;
int y;
}a[100000];
main()
{
int n,i,j,d=0,b[100000],c[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i].num);
scanf("%d",&a[i].x);
scanf("%d",&a[i].y);
}
for(i=0;i<n;i++)
{
b[i]=a[i].x+a[i].y;
}
qsort(b,n,sizeof(int),pfCompare);
for(j=0;j<n;j++)
{
if(b[n-1]==a[j].x+a[j].y)
{
printf("%d"" ""%d",a[j].num,b[n-1]);
printf("\n");
d++;
}
if(d==3)
break;
}
for(i=n-2;i>n-4;i--)
{
if(b[i]==b[i+1])
continue;
else
{
for(j=0;j<n;j++)
{
if(b[i]==a[j].x+a[j].y)
{
printf("%d"" ""%d",a[j].num,b[i]);
printf("\n");
d++;
}
if(d==3)
break;
}
if(d==3)
break;
}
}
}
| 14 |
6,668 | int main() {
int n = 0, i = 0, j = 0;
cin >> n;
int sum[n];
struct student {
int stuid;
int chin;
int math;
} stu[n], t;
for (i = 0; i < n; i++) {
cin >> stu[i].stuid >> stu[i].chin >> stu[i].math;
sum[i] = stu[i].chin + stu[i].math;
}
for (i = 0; i < 3; i++)
for (j = 0; j < n -1; j++)
if ((stu[j].chin + stu[j].math) >= (stu[j + 1].chin
+ stu[j + 1].math)) {
t = stu[j];
stu[j] = stu[j + 1];
stu[j + 1] = t;
}
for (i = n-1; i > n-4; i--)
cout << stu[i].stuid << " " << stu[i].chin + stu[i].math << endl;
return 0;
} | 14 |
6,669 | struct stu
{
long num;
int score1;
int score2;
struct stu *next;
};
struct stu *creat(void)
{
int n,i=1;
struct stu *head;
struct stu *p1,*p2;
scanf("%d",&n);
p1=p2=(struct stu*)malloc(len);
head=NULL;
while(i<=n)
{
scanf("%ld %d %d",&p1->num,&p1->score1,&p1->score2);
if(i==1)head=p1;
else p2=p1;
if(i!=n)p1=p2->next=(struct stu*)malloc(len);
else p1->next=NULL;
i++;
}
return(head);
}
void turn(struct stu *head)
{
int t=1,r=1,a;
struct stu *q1,*q2,*p3,*p1,*p2;
for(q1=p3=p2=head;q1->next!=NULL,t<=3;t++)
{
a=0;
for(q2=p1=q1->next,r=1;q2!=NULL;q2=q2->next,r++)
{
if((q1->score1+q1->score2)<(q2->score1+q2->score2))
{
q1=q2;p2=p1;a=1;
}
if(r!=1)p1=p1->next;
}
printf("%ld %d\n",q1->num,q1->score1+q1->score2);
if(a==1)
{
p2->next=q1->next;
q1=head;
}
else
{
q1=p3->next;
p3=q1;
}
}
}
void main()
{
struct stu *ip;
ip=creat();
turn(ip);
} | 14 |
6,670 | int main()
{
int a[100001][5];
int i , j , n, k = 3, max = 0, t=0;
scanf( "%d",&n );
for( i = 1 ;i <= n;i++ )
{scanf("%d%d%d",&a[i][1], &a[i][2], &a[i][3]);
a[i][4] = a[i][2] + a[i][3];
}
while( k-- )
{
for( i = 1;i <= n ;i++ )
{
if( a[i][4] > max )
{max = a[i][4] , t = i;}
}
printf( "%d %d\n",t,a[t][4] );
a[t][4] = 0;
max = 0;
}
}
| 14 |
6,671 | struct student
{
long int id;
int yuwen;
int shuxue;
int total;
struct student *next;
};
long int n;
int main()
{
struct student *p0,*p1,*p2,*head,*p;
int i;
scanf ("%ld\n",&n);
p0=(struct student *)malloc(sizeof(struct student));
scanf ("%ld %d %d",&p0->id,&p0->yuwen,&p0->shuxue);
p0->total=p0->yuwen+p0->shuxue;
head=p0;p1=p0;
p0=(struct student *)malloc(sizeof(struct student));
scanf ("%ld %d %d",&p0->id,&p0->yuwen,&p0->shuxue);
p0->total=p0->yuwen+p0->shuxue;
if (p0->total<=p1->total)
{
p1->next=p0;
p1=p0;
}
else
{
head=p0;
p0->next=p1;
}
p0=(struct student *)malloc(sizeof(struct student));
scanf ("%ld %d %d",&p0->id,&p0->yuwen,&p0->shuxue);
p0->total=p0->yuwen+p0->shuxue;
if (p0->total<=p1->total)
{
p1->next=p0;
p2=p0;
}
else if (p0->total>p1->total&&p0->total<=head->total)
{
head->next=p0;
p0->next=p1;
p2=p1;
p1=p0;
}
else if (p0->total>head->total)
{
p0->next=head;
p2=p1;p1=head;head=p0;
}
p2->next=NULL;
for (i=3;i<n;i++)
{
p0=(struct student *)malloc(sizeof(struct student));
scanf ("%ld %d %d",&p0->id,&p0->yuwen,&p0->shuxue);
p0->total=p0->yuwen+p0->shuxue;
if (p0->total>p2->total)
{
if(p0->total<=p1->total)
{
p1->next=p0;
p0->next=NULL;
p2=p0;
}
else if (p0->total>p1->total&&p0->total<=head->total)
{
head->next=p0;
p0->next=p1;
p1->next=NULL;
p1=p2;p0=p1;
}
else if (p0->total>head->total)
{
p0->next=head;
p1->next=NULL;
p2=p1;p1=head;head=p0;
}
}
}
p=head;
for (i=0;i<3;i++)
{
printf("%ld %d\n",p->id,p->total);
p=p->next;
}
}
| 14 |
6,672 |
struct student
{
char id[10];
int ch;
int ma;
};
int main(int argc, char* argv[])
{
int n,i,max,sec,min,total[100000];
scanf("%d",&n);
struct student stu[100000];
for(i=0;i<n;i++)
{
scanf("%s%d%d",stu[i].id, &stu[i].ch, &stu[i].ma);
total[i]=stu[i].ch + stu[i].ma;
}
max = 0;
for(i=0;i<n;i++)
{
if(total[i]>total[max])
max = i;
}
printf("%s %d\n",stu[max].id, total[max]);
for(i=0;i<n;i++)
{
if(total[i]==total[max])
{
total[i]=0;
break;
}
}
sec = 0;
for(i=0;i<n;i++)
{
if(total[i]>total[sec])
sec=i;
}
printf("%s %d\n", stu[sec].id, total[sec]);
for(i=0;i<n;i++)
{
if(total[i]==total[sec])
{
total[i]=0;
break;
}
}
min = 0;
for(i=0;i<n;i++)
{
if(total[i]>total[min])
min=i;
}
printf("%s %d\n", stu[min].id, total[min]);
return 0;
}
| 14 |
6,673 | void main()
{
int a[100000],b[100000],d[100000],i,j,n,t,s;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a[i],&b[i],&d[i]);
d[i]=b[i]+d[i];
}
for(i=0;i<3;i++)
{
for(j=n-1;j>i;j--)
{
if (d[j]>d[j-1])
{
t=d[j];s=a[j];
d[j]=d[j-1];a[j]=a[j-1];
d[j-1]=t;a[j-1]=s;
}
}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",a[i],d[i]);
}
}
| 14 |
6,674 | struct student { int id; char yw;char sx;int zf;int pm;};
int main()
{
struct student a[100000],b[2];
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d%d",&a[i].id,&a[i].yw,&a[i].sx);
for(i=0;i<n;i++)
a[i].zf=a[i].yw+a[i].sx;
j=0;
for(i=0;i<n;i++)
if(a[i].zf>j)
{j=a[i].zf;b[0]=a[i];}
printf("%d %d\n",b[0].id,b[0].zf);
j=0;
for(i=0;i<n;i++)
if(a[i].zf>j&&a[i].id!=b[0].id)
{j=a[i].zf;b[1]=a[i];}
printf("%d %d\n",b[1].id,b[1].zf);
j=0;
for(i=0;i<n;i++)
if(a[i].zf>j&&a[i].id!=b[0].id&&a[i].id!=b[1].id)
{j=a[i].zf;b[2]=a[i];}
printf("%d %d\n",b[2].id,b[2].zf);
} | 14 |
6,675 | struct student{
int num;
int yuwen;
int shuxue;
int score;
struct student *next;
};
int n,i=0,a;
struct student *m1,*m2,*m3,*q;
struct student *creat(void)
{
struct student *head;
struct student *p1,*p2;
p1=p2=(struct student*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->yuwen,&p1->shuxue);
p1->score=p1->yuwen+p1->shuxue;
head=NULL;
while(i<n-1)
{
if(i==0)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->yuwen,&p1->shuxue);
p1->score=p1->yuwen+p1->shuxue;
if(i>=3)
{
if(p2->score>m1->score)
{
m3=m2;
m2=m1;
m1=p2;
}
else if(p2->score<=m1->score&&p2->score>m2->score)
{
m3=m2;
m2=p2;
}
else if(p2->score<=m2->score&&p2->score>m3->score)
m3=p2;
i++;
continue;
}
if(i==0)m1=p2;
else if(i==1)m2=p2;
else if(i==2)
{
m3=p2;
if(m1->score>m2->score)
{
if(m2->score<=m3->score)
{
if(m1->score>m3->score)
{
q=m3;
m3=m2;
m2=q;
}
else if(m1->score<=m3->score)
{
q=m1;m1=m2;m2=m3;m3=q;
}
}
}
else if(m1->score<=m2->score)
{
if(m2->score>m3->score)
{
if(m1->score>m3->score)
{
q=m1;
m1=m2;
m2=q;
}
else if(m1->score<=m3->score)
{
q=m3;m3=m1;m1=m2;m2=q;
}
}
else if(m2->score<=m3->score)
{
q=m1;
m1=m3;
m3=q;
}
}
}
i++;
}
return(head);
}
int main()
{
struct student *head;
scanf("%d",&n);
head=creat();
printf("%d %d\n",m1->num,m1->score);
printf("%d %d\n",m2->num,m2->score);
printf("%d %d\n",m3->num,m3->score);
return 0;
}
| 14 |
6,676 | struct Student{
int no;
int chinese;
int math;
int total;
};
int main()
{
struct Student stu[100000],t;
int n,i,j,max,order;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&stu[i].no,&stu[i].chinese,&stu[i].math);
stu[i].total=stu[i].chinese+stu[i].math;
}
for(i=0;i<3;i++){
max=stu[i].total;
order=i;
for(j=i+1;j<n;j++){
if(stu[j].total>max){
max=stu[j].total;
order=j;
}
}
if(order!=i){
t=stu[i];stu[i]=stu[order];stu[order]=t;
}
printf("%d %d\n",stu[i].no,stu[i].total);
}
return 0;
} | 14 |
6,677 | struct student
{ int num;int a;int b;int sum;int c;};
void main()
{
int n,i,j,nt,ct;
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].sum=stu[i].a+stu[i].b;stu[i].c=stu[i].sum;}
for(i=0;i<3;i++)
for(j=i+1;j<n;j++)
{
if(stu[i].c<stu[j].c){
nt=stu[i].num;stu[i].num=stu[j].num;stu[j].num=nt;
ct=stu[i].c;stu[i].c=stu[j].c;stu[j].c=ct;
}
}
for(i=0;i<3;i++)
printf("%d %d\n",stu[i].num,stu[i].c);
}
| 14 |
6,678 | // ????????.cpp : ??????????????
//
struct student
{
int id;
int chinese;
int math;
int total;
};
int main()
{
int number;
struct student stu[100000];
scanf("%d\n",&number);
for(int i=1;i<=number;++i)
{
scanf("%d%d%d",&stu[i].id,&stu[i].chinese,&stu[i].math);
stu[i].total=stu[i].chinese+stu[i].math;
}
for(int i=1;i<=3;++i)
{
for(int j=i+1;j<=number;++j)
{
if(stu[i].total<stu[j].total)
{
struct student temp;
temp=stu[i];
stu[i]=stu[j];
stu[j]=temp;
}
}
printf("%d %d\n",stu[i].id,stu[i].total);
}
return 0;
}
| 14 |
6,679 | /*
* ????????.cpp
*
* Created on: 2010-12-24
* Author: wangwei
*/
struct student
{
int id;
int chinese;
int math;
int together;
}stu[100000],t;
int main()
{
int n,i,j;
cin>>n;
for(i=0;i<n;i++)
{
cin>>stu[i].id>>stu[i].chinese>>stu[i].math;
stu[i].together=stu[i].chinese+stu[i].math;
}
for(i=0;i<3;i++)
for(j=i;j<n;j++)
{
if(stu[i].together<stu[j].together)
{
t=stu[i];
stu[i]=stu[j];
stu[j]=t;
}
}
for(i=0;i<3;i++)
{
cout<<stu[i].id<<' '<<stu[i].together<<endl;
}
return 0;
} | 14 |
6,680 |
struct stu
{
int num;
int ch;
int math;
int total;
} a[100000];
struct str
{
int num;
int total;
} b[100000];
main()
{
int i,n,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d %d %d\n",&a[i].num,&a[i].ch,&a[i].math);
b[i].num=a[i].num;
b[i].total=a[i].ch+a[i].math;}
for(i=0; i<3; i++)
{
for(j=i+1;j<n;j++)
if (b[i].total<b[j].total)
{
b[n]=b[i];
b[i]=b[j];
b[j]=b[n];
}
}
for(i=0;i<3;i++)
printf("%d %d\n",b[i].num,b[i].total);
}
| 14 |
6,681 | struct stu
{
int id;
int eng;
int math;
int sum;
struct stu *next;
}*head,*p1,*p2;
struct stu *order(int n)
{
int i,j,t;
p1=head;
for(i=0;i<3;i++)
{
p2=p1->next;
for(j=i+1;j<n;j++)
{ if(p1->sum<p2->sum)
{
t=p1->id;p1->id=p2->id;p2->id=t;
t=p1->sum;p1->sum=p2->sum;p2->sum=t;
}
p2=p2->next;}
p1=p1->next;
}
return head;
}
void main()
{
int n,i;
scanf("%d",&n);
p1=head=(struct stu *)malloc(sizeof(struct stu));
for(i=0;i<n;i++)
{
scanf("%d %d %d",&p1->id,&p1->eng,&p1->math);
p1->sum=p1->eng+p1->math;
p2=p1;
p1=(struct stu *)malloc(sizeof(struct stu));
p2->next=p1;
}
p2->next=NULL;
p1=order(n);
for(i=0;i<3;i++)
{
printf("%d %d\n",p1->id,p1->sum);
p1=p1->next;
}
} | 14 |
6,682 | struct student
{
int id;
int c;
int m;
int t;
} a[SIZE];
int cmp(const void*p1,const void*p2)
{
struct student*p3=(struct student*)p1;
struct student*p4=(struct student*)p2;
return -p3->t+p4->t;
}
int main(void)
{
int n, i;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d%d%d",&a[i].id,&a[i].c,&a[i].m);a[i].t=a[i].m+a[i].c;}
qsort(a,n,sizeof(a[0]),cmp);
for(i=0;i<3;i++)
printf("%d %d\n", a[i].id, a[i].c+a[i].m);
return 0;
}
| 14 |
6,683 | void main()
{
int n,i,j,k=0,e=0,max,y;scanf("%d",&n);
struct st
{
int a;int z;int c;
int d;
}b[100000];
for(i=0;i<n;i++)
{
scanf("%d%d%d",&b[i].a,&b[i].z,&b[i].c);b[i].d=b[i].z+b[i].c;
}
for(i=0;i<n;i++)
{
max=0;
for(j=0;j<n;j++)
{if(b[j].d>max){max=b[j].d;y=j;}}
printf("%d %d\n",b[y].a,b[y].d);e++;b[y].d=0;if(e==3)break;
}
} | 14 |
6,684 | struct student
{
long num;
int scorec;
int scorem;
struct student *next;
};
struct student *creat(long n)
{
struct student *head,*p1,*p2;
p1=(struct student*)malloc(LEN);
scanf("%ld %d %d",&p1->num,&p1->scorec,&p1->scorem);
long s=n-1;
p1->next=NULL;
head=p1;
p2=p1;
do
{
p1=(struct student*)malloc(LEN);
scanf("%ld %d %d",&p1->num,&p1->scorec,&p1->scorem);
p1->next=NULL;
p2->next=p1;
p2=p1;
s=s-1;
}while(s);
return(head);
}
void main()
{
struct student *head,*p,*q,stu1,stu2,stu3;
long n,k1=-1,k2=-1,k3=-1,i,j;
int l;
scanf("%ld",&n);
head=creat(n);
for(p=head,i=0;p!=NULL;p=p->next,i++)
{
l=0;
for(q=head,j=0;q!=NULL;q=q->next,j++)
if((q->scorec+q->scorem)>(p->scorec+p->scorem)||(((q->scorec+q->scorem)==(p->scorec+p->scorem))&&j<i))
{
l=l+1;
if(l>3)break;
}
if(l==0)
{
k1=i;
stu1.num=p->num;stu1.scorec=p->scorec;stu1.scorem=p->scorem;
}
if(l==1)
{
k2=i;
stu2.num=p->num;stu2.scorec=p->scorec;stu2.scorem=p->scorem;
}
if(l==2)
{
k3=i;
stu3.num=p->num;stu3.scorec=p->scorec;stu3.scorem=p->scorem;
}
if(k1!=-1&&k2!=-1&&k3!=-1)break;
}
printf("%ld %d\n",stu1.num,stu1.scorec+stu1.scorem);
printf("%ld %d\n",stu2.num,stu2.scorec+stu2.scorem);
printf("%ld %d",stu3.num,stu3.scorec+stu3.scorem);
} | 14 |
6,685 | void main(int argc, char* argv[])
{
int num,chi,math,sum;
struct student{
int num,chi,math,sum;
}students[100000];
int i;
int STUDENT_NUM;
scanf("%d",&STUDENT_NUM);
for (i=0;i<STUDENT_NUM;i++)
{
scanf("%d %d %d",&num,&chi,&math);
students[i].num=num;
students[i].chi=chi;
students[i].math=math;
sum=chi+math;
students[i].sum=sum;
}
int sum1=0,sum2=0,sum3=0;
int num1,num2,num3;
for (i=0;i<STUDENT_NUM;i++)
{
if(i==0)
{
sum1=students[0].sum;
num1=students[0].num;
}
else if(i==1)
{
if(students[1].sum>students[0].sum)
{
sum2=sum1;
num2=num1;
sum1=students[1].sum;
num1=students[1].num;
}
else
{
sum2=students[1].sum;
num2=students[1].num;
}
}
else
{
if(students[i].sum>sum1)
{
sum3=sum2;
num3=num2;
sum2=sum1;
num2=num1;
sum1=students[i].sum;
num1=students[i].num;
}
else if(students[i].sum>sum2)
{
sum3=sum2;
num3=num2;
sum2=students[i].sum;
num2=students[i].num;
}
else if(students[i].sum>sum3)
{
sum3=students[i].sum;
num3=students[i].num;
}
}
}
printf("%d %d\n",num1,sum1);
printf("%d %d\n",num2,sum2);
printf("%d %d\n",num3,sum3);
} | 14 |
6,686 | struct student
{int num;
int yu;
int shu;
int score;
struct student *next;
};
void main()
{
int n,i,max;
struct student *p1,*p2,*head;
p1=p2=head=NULL;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p1=(struct student *)malloc(sizeof(struct student));
scanf("%d %d %d",&p1->num,&p1->yu,&p1->shu);
p1->score=p1->yu+p1->shu;
if(i==0)head=p1;
else p2->next=p1;
p2=p1;
}
p2->next=NULL;
for(i=0;i<3;i++)
{
p2=p1=head;
max=p1->score;
while(p1!=NULL)
{
if(p1->score>max){max=p1->score;p2=p1;}
p1=p1->next;
}
printf("%d %d\n",p2->num,max);
p1=head;
while(p1->next!=p2)
{
p1=p1->next;
}
p1->next=p2->next;
}
}
| 14 |
6,687 | int main(){
int n,i,max1=0,num1=0,max2=0,num2=0,max3=0,num3=0;
struct stu{
int num;
int chn;
int mat;
int sum;
}sco[100000];
cin>>n;
for(i=0;i<n;i++){
cin>>sco[i].num>>sco[i].chn>>sco[i].mat;
sco[i].sum=sco[i].chn+sco[i].mat;
}
for(i=0;i<n;i++){
if(sco[i].sum>max1){
max3=max2;
num3=num2;
max2=max1;
num2=num1;
max1=sco[i].sum;
num1=i;
}
else{
if(sco[i].sum>max2){
max3=max2;
num3=num2;
max2=sco[i].sum;
num2=i;
}
else {
if(sco[i].sum>max3){
max3=sco[i].sum;
num3=i;
}
}
}
}
cout<<num1+1<<' '<<max1<<endl;
cout<<num2+1<<' '<<max2<<endl;
cout<<num3+1<<' '<<max3<<endl;
return 0;
}
| 14 |
6,688 | struct stu
{
int num;
int chi;
int math;
int s;
struct stu *next;
};
struct stu *creat(int n)
{
int i;
struct stu *head;
struct stu *p1,*p2;
p1=p2=(struct stu *)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->chi,&p1->math);
head=p1;
for(i=1;i<n;i++)
{
p1=(struct stu*)malloc(sizeof(struct stu));
scanf("%d %d %d",&p1->num,&p1->chi,&p1->math);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return (head);
}
void main()
{
int i,n,t,m;
struct stu *head,*p1,*p2;
scanf("%d",&n);
head=creat(n);
p1=head;
for(i=0;i<n;i++)
{
p1->s=p1->chi+p1->math;
p1=p1->next;
}
p1=head;
p2=p1->next;
for(i=0;i<3;i++)
{
while(p2!=NULL)
{
if(p2->s>p1->s)
{
t=p2->s;
p2->s=p1->s;
p1->s=t;
m=p2->num;
p2->num=p1->num;
p1->num=m;
}p2=p2->next;
}printf("%d %d\n",p1->num,p1->s);
if(i==2)break;
p1=p1->next;p2=p1->next;
}
} | 14 |
6,689 | struct mark
{
int num;
int ch;
int math;
int sum;
}stu[100000];
int main(int argc, char* argv[])
{
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&stu[i].num,&stu[i].ch,&stu[i].math);
stu[i].sum=stu[i].math+stu[i].ch;
}
for(i=0;i<n-1;i++){
if(stu[i].sum>=stu[i+1].sum){
stu[100000]=stu[i];
stu[i]=stu[i+1];
stu[i+1]=stu[100000];
}
}
for(i=0;i<n-2;i++){
if(stu[i].sum>=stu[i+1].sum){
stu[100000]=stu[i];
stu[i]=stu[i+1];
stu[i+1]=stu[100000];
}
}
for(i=0;i<n-3;i++){
if(stu[i].sum>=stu[i+1].sum){
stu[100000]=stu[i];
stu[i]=stu[i+1];
stu[i+1]=stu[100000];
}
}
printf("%d %d\n%d %d\n%d %d\n",stu[n-1].num,stu[n-1].sum,stu[n-2].num,stu[n-2].sum,stu[n-3].num,stu[n-3].sum);
return 0;
}
| 14 |
6,690 | struct stu
{
int id;
int shu;
int yu;
int he;
};
struct stu stu[100000];
int main()
{
int n,i,max,sec,th;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&stu[i].id,&stu[i].shu,&stu[i].yu);
stu[i].he=stu[i].shu+stu[i].yu;
}
max=1;
for(i=1;i<n;i++)
{
if(stu[max].he<stu[i+1].he)
max=i+1;
}
printf("%d %d\n",stu[max].id,stu[max].he);
stu[max].he=0;
sec=1;
for(i=1;i<n;i++)
{
if(stu[sec].he<stu[i+1].he)
sec=i+1;
}
printf("%d %d\n",stu[sec].id,stu[sec].he);
stu[sec].he=0;
th=1;
for(i=1;i<n;i++)
{
if(stu[th].he<stu[i+1].he)
th=i+1;
}
printf("%d %d\n",stu[th].id,stu[th].he);
getchar();
getchar();
}
| 14 |
6,691 | int main()
{
struct student{
int number;
int chinese;
int math;
int sum;
}students[100000];
int n,i;
int a1,b1,a2,b2,a3,b3;
int c1,c2;
int max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&students[i].number,&students[i].chinese,&students[i].math);
students[i].sum=students[i].chinese+students[i].math;
}
max=0;
for(i=0;i<n;i++)
{
if(students[i].sum>max)
{
max=students[i].sum;
a1=students[i].number;
b1=students[i].sum;
c1=i;
}
}
max=0;
for(i=0;i<n;i++)
{
if(students[i].sum>max&&i!=c1)
{
max=students[i].sum;
a2=students[i].number;
b2=students[i].sum;
c2=i;
}
}
max=0;
for(i=0;i<n;i++)
{
if(students[i].sum>max&&i!=c2&&i!=c1)
{
max=students[i].sum;
a3=students[i].number;
b3=students[i].sum;
}
}
printf("%d %d\n",a1,b1);
printf("%d %d\n",a2,b2);
printf("%d %d\n",a3,b3);
return 0;
}
| 14 |
6,692 | struct student
{long num;
int yuwen;
int shuxue;
int sum;
struct student *next;
};
int n;
void main()
{
struct student *creat(void);
void shuchu(struct student *head);
int i;
struct student *head;
scanf("%d",&n);
head=creat();
for(i=0;i<3;i++)
shuchu(head);
}
struct student *creat(void)
{
int i,k=0;
struct student *head;
struct student *p1,*p2;
p1=p2=(struct student *)malloc(len);/*???????*/
scanf("%ld%d%d",&p1->num,&p1->yuwen,&p1->shuxue);
p1->sum=p1->shuxue+p1->yuwen;
head=NULL;
for(i=0;i<n;i++)
{
k++;
if(k==1)
head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student *)malloc(len);
scanf("%ld%d%d",&p1->num,&p1->yuwen,&p1->shuxue);
p1->sum=p1->shuxue+p1->yuwen;
}
p2->next=NULL;
return(head);
}
void shuchu(struct student *head)
{
struct student *p;
int max,i;
p=head;
max=p->sum;
for(i=0;i<n;i++)
{
if(p->sum>max)
max=p->sum;
p=p->next;
}
p=head;
for(i=0;i<n;i++)
{
if(p->sum==max)
{
printf("%ld %d\n",p->num,p->sum);
p->sum=0;
break;
}
p=p->next;
}
} | 14 |
6,693 | struct student
{
int num;
int yu;
int shu;
int sum;
} stu[100000];
int main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&stu[i].num, &stu[i].yu, &stu[i].shu);
stu[i].sum=stu[i].shu+stu[i].yu;
}
int k,e;
for(k=0;k<3;k++){
for(i=n-2;i>=k;i--){
if(stu[i].sum<stu[i+1].sum){
e=stu[i].sum;
stu[i].sum=stu[i+1].sum;
stu[i+1].sum=e;
e=stu[i].num;
stu[i].num=stu[i+1].num;
stu[i+1].num=e;
}
}
}
for(i=0;i<3;i++){
printf("%d %d\n",stu[i].num,stu[i].sum);
}
return 0;
}
| 14 |
6,694 | struct student
{
int num;
int chi;
int mat;
int all;
struct student *next;
}
main()
{
struct student *head,*p1,*p2,*p;
long n,i;
int j,max;
scanf("%d",&n);
p1=p2=(struct student*)malloc(LEN);
scanf("%d%d%d",&p1->num,&p1->chi,&p1->mat);
p1->all=p1->chi+p1->mat;
head=p1;
for(i=1;i<n;i++)
{
if(i>1)
p2->next=p1;
p2=p1;
p1=(struct student*)malloc(LEN);
scanf("%d%d%d",&p1->num,&p1->chi,&p1->mat);
p1->all=p1->chi+p1->mat;
}
p2->next=NULL;
for(j=0;j<3;j++)
{
p=p1=head;
max=p->all;
while(p->next!=NULL)
{
p2=p;
p=p->next;
if(p->all>max)
{
max=p->all;
p1=p2;
}
}
printf("%d %d\n",p1->next->num,p1->next->all);
if(max==head->all)
head=head->next;
else
p1->next=(p1->next)->next;
}
} | 14 |
6,695 | struct student
{
int num;
int yuwen;
int math;
int total;
struct student *next;
};
long m,n,k;
struct student *creat(void)
{
struct student *head;
struct student *p1,*p2,*p3;
m=0;head=0;
while(m<n)
{
m=m+1;
p1=(struct student *)malloc(sizeof(struct student));
scanf("%d %d %d",&p1->num,&p1->yuwen,&p1->math);
p1->total=p1->yuwen+p1->math;
p2=head;
if(m==1){head=p1;p1->next=0;}
else
{
k=0;
while(p1->total<=p2->total&&p2->next!=0&&k<=3)
{
p3=p2;
p2=p2->next;k++;
}
if(p1->total>p2->total&&k<=3)
{
if(head==p2)head=p1;
else p3->next=p1;
p1->next=p2;
}
else
{
p2->next=p1;p1->next=0;
}
}
}
return(head);
}
void main()
{
struct student *head,*p,*px;
int t1=0,t2;
scanf("%ld",&n);
head=creat();
p=head;
while(t1<3)
{
printf("%d %d\n",p->num,p->total);
p=p->next;
t1++;
}
} | 14 |
6,696 | int main()
{
struct Student
{
int num;
int ch;
int math;
}stu[100000];
int n,i,x=0,m=0,k=0,j,a[100000]={0};
scanf("%d",&n);
for(i=0;i<n-1;i++)
{
scanf("%d %d %d\n",&stu[i].num,&stu[i].ch,&stu[i].math);
a[i]=stu[i].ch+stu[i].math;
}
for(j=0;j<3;j++)
{
for(i=0;i<n;i++)
{
if(a[i]>m)
{
m=a[i];
x=stu[i].num;
k=i;
}
}
printf("%d %d\n",x,m); a[k]=0;
m=0;x=0;
}
return 0;
}
| 14 |
6,697 | struct student
{
int num;
int chn;
int math;
int sum;
}stu[100000];
main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d%d%d",&stu[i].num,&stu[i].math,&stu[i].chn);
stu[i].sum=stu[i].math+stu[i].chn;
}
int j,sum[100000],order[4]={n-1},t,m;
struct student temp;
for(j=n-1;j>=n-3;j--)
{
for (i=0;i<j;i++)
{if (stu[i].sum>=stu[i+1].sum)
{
temp=stu[i+1];
stu[i+1]=stu[i];
stu[i]=temp;
}
}
}
printf("%d %d\n",stu[n-1].num,stu[n-1].sum);
printf("%d %d\n",stu[n-2].num,stu[n-2].sum);
printf("%d %d\n",stu[n-3].num,stu[n-3].sum);
getchar();
getchar();
}
| 14 |
6,698 |
struct student
{
int ID;
int chi;
int math;
int total;
} stu[1000000];
void main()
{
int STUDENT_NUM,i,j,temp1,temp2;
scanf("%d",&STUDENT_NUM);
for(i=0;i<STUDENT_NUM;i++)
{
scanf("%d %d %d",&stu[i].ID,&stu[i].chi,&stu[i].math);
stu[i].total=stu[i].chi+stu[i].math;
}
for(i=0;i<3;i++)
{
for(j=i+1;j<STUDENT_NUM;j++)
{
if(stu[i].total<stu[j].total)
{
temp1=stu[i].ID;
stu[i].ID=stu[j].ID;
stu[j].ID=temp1;
temp2=stu[i].total;
stu[i].total=stu[j].total;
stu[j].total=temp2;
}
}
}
printf("%d %d\n%d %d\n%d %d\n",stu[0].ID,stu[0].total,stu[1].ID,stu[1].total,stu[2].ID,stu[2].total);
}
| 14 |
6,699 | int main()
{
int n,i,j;
cin>>n;
struct student
{
int num;
int yuwen;
int shuxue;
int sum;
}stu[100000];
for(i=0;i<n;i++)
{
cin>>stu[i].num>>stu[i].yuwen>>stu[i].shuxue;
stu[i].sum=stu[i].yuwen+stu[i].shuxue;
}
int max=0,maxj=0;
if(n>=3)
{
for(i=0;i<n;i++)
if(stu[i].sum>max)
{
max=stu[i].sum;
maxj=i;
}
cout<<stu[maxj].num<<' '<<stu[maxj].sum<<endl;
stu[maxj].sum=0;max=0;
for(i=0;i<n;i++)
if(stu[i].sum>max)
{
max=stu[i].sum;
maxj=i;
}
cout<<stu[maxj].num<<' '<<stu[maxj].sum<<endl;
stu[maxj].sum=0;max=0;
for(i=0;i<n;i++)
if(stu[i].sum>max)
{
max=stu[i].sum;
maxj=i;
}
cout<<stu[maxj].num<<' '<<stu[maxj].sum<<endl;
}
else
{
if(stu[0].sum>stu[1].sum)
cout<<stu[0].num<<' '<<stu[0].sum<<endl<<stu[1].num<<' '<<stu[1].sum;
else cout<<stu[1].num<<' '<<stu[1].sum<<endl<<stu[0].num<<' '<<stu[0].sum;
}
return 0;
} | 14 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.