id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
6,700 |
struct stu
{
char name[20];
int sbu[3];
};
int main()
{
int n;
scanf("%d",&n);
int i,j=0,j2=0,j3=0,min=0;
struct stu stu[100000];
for(i=0;i<n;i++)
{
scanf("%s %d %d",stu[i].name,&stu[i].sbu[0],&stu[i].sbu[1]);
stu[i].sbu[2]=stu[i].sbu[0]+stu[i].sbu[1];
}
for(i=0;i<n;i++)
{
if(stu[i].sbu[2]>min)
{min=stu[i].sbu[2];
j=i;}
}
printf("%s %d\n",stu[j].name,min);
min=0;
for(i=0;i<n;i++)
{
if(stu[i].sbu[2]<=stu[j].sbu[2]&&stu[i].sbu[2]>min&&i!=j)
{min=stu[i].sbu[2];
j2=i;}
}
printf("%s %d\n",stu[j2].name,min);
min=0;
for(i=0;i<n;i++)
{
if(stu[i].sbu[2]<=stu[j2].sbu[2]&&stu[i].sbu[2]>min&&i!=j&i!=j2)
{min=stu[i].sbu[2];
j3=i;}
}
printf("%s %d\n",stu[j3].name,min);
} | 14 |
6,701 | struct student
{
long num;
int math;
int chinese;
struct student *next;
};
long stu_num;
struct student *max1,*max2,*max3;
struct student *creat(void)
{
struct student *head,*p1,*p2;
long n;
p1=p2=(struct student *)malloc(LEN);
scanf("%ld%d%d",&p1->num,&p1->math,&p1->chinese);
head=NULL;
n=0;
while(n<stu_num-1)
{
n++;
if(n==1)
head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%ld%d%d",&p1->num,&p1->math,&p1->chinese);
}
p2->next=p1;
p1->next=NULL;
return(head);
}
void Max1(struct student *head,long stu_num)
{
struct student *q1;
q1=head;
max1=head;
for(;q1!=NULL;)
if((max1->math+max1->chinese)<(q1->math+q1->chinese))
{
max1=q1;
q1=q1->next;
}
else
q1=q1->next;
printf("%ld %d\n",max1->num,max1->math+max1->chinese);
}
void Max2(struct student *head,long stu_num)
{
struct student *q2;
q2=head;
if(head!=max1)
max2=head;
else
max2=q2->next;
for(;q2!=NULL;)
if((max2->math+max2->chinese)<(q2->math+q2->chinese)&&q2!=max1)
{
max2=q2;
q2=q2->next;
}
else
q2=q2->next;
printf("%ld %d\n",max2->num,max2->math+max2->chinese);
}
void Max3(struct student *head,long stu_num)
{
struct student *q3;
q3=head;
for(;q3!=NULL;)
if(q3==max1||q3==max2)
q3=q3->next;
else
{
max3=q3;
break;
}
q3=head;
for(;q3!=NULL;)
if((max3->math+max3->chinese)<(q3->math+q3->chinese)&&q3!=max1&&q3!=max2)
{
max3=q3;
q3=q3->next;
}
else
q3=q3->next;
printf("%ld %d\n",max3->num,max3->math+max3->chinese);
}
void main()
{
struct student *head;
scanf("%ld",&stu_num);
head=creat();
Max1(head,stu_num);
Max2(head,stu_num);
Max3(head,stu_num);
}
| 14 |
6,702 |
struct
{
int ID[100000],Chinese[100000],Maths[100000];
}stu;
int main()
{
int n,i,sum[100000],max1=0,max2=0,max3=0,num1,num2,num3;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&stu.ID[i],&stu.Chinese[i],&stu.Maths[i]);
}
i=0;
while(stu.ID[i]>0){
sum[i]=stu.Chinese[i]+stu.Maths[i];
i++;
}
i=0;
while(i<n){
if(sum[i]>max1){
max1=sum[i];
num1=i;
}
i++;
}
i=0;
while(i<n){
if(sum[i]>max2&&sum[i]<=max1&&i!=num1){
max2=sum[i];
num2=i;
}
i++;
}
i=0;
while(i<n){
if(sum[i]>max3&&sum[i]<=max2&&i!=num2&&i!=num1){
max3=sum[i];
num3=i;
}
i++;
}
printf("%d %d\n%d %d\n%d %d",stu.ID[num1],max1,stu.ID[num2],max2,stu.ID[num3],max3);
return 0;
} | 14 |
6,703 | struct student
{
int num;
int yuwen;
int shuxue;
struct student *next;
};
int m;
void main()
{
int n;
scanf("%d",&n);
struct student *creat(int n);
void print(struct student *head,int n);
struct student *head;
head=creat(n);
print(head,n);
print(head,n);
print(head,n);
}
struct student *creat(int n)
{
struct student *head;
struct student *p1,*p2;
m=0;
p1=p2=(struct student*)malloc(LEN);
scanf("%d %d %d\n",&p1->num,&p1->yuwen,&p1->shuxue);
head=NULL;
for(;n!=0;n--)
{
m+=1;
if(m==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student*)malloc(LEN);
scanf("%d %d %d\n",&p1->num,&p1->yuwen,&p1->shuxue);
}
p2->next=NULL;
return(head);
}
void print(struct student *head,int n)
{
struct student *p,*q;
p=head;
int max=0,index=0;
for(;n!=0;n--)
{
if(max<((p->yuwen)+(p->shuxue)))
{
max=((p->yuwen)+(p->shuxue));
index=p->num;
q=p;
}
p=p->next;
}
printf("%d %d\n",index,max);
q->yuwen=0;
q->shuxue=0;
} | 14 |
6,704 |
struct student
{
int num;
int chi;
int mat;
int tol;
struct student *next;
};
void main()
{
struct student *p1,*p2,*head;
struct student *p,*a,*b,*c;
struct student temp;
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p1=(struct student*)malloc(LEN);
scanf("%d%d%d",&p1->num,&p1->chi,&p1->mat);
p1->tol=p1->chi+p1->mat;
if(i==0)
head=p2=p1;
else
p2->next=p1;
p2=p1;
}
p2->next=NULL;
p=head;
temp.tol=0;
a=b=c=&temp;
while(p!=NULL)
{
if(p->tol>a->tol)
{
c=b;
b=a;
a=p;
}
else if(p->tol>b->tol)
{
c=b;
b=p;
}
else if(p->tol>c->tol)
c=p;
p=p->next;
}
printf("%d %d\n",a->num,a->tol);
printf("%d %d\n",b->num,b->tol);
printf("%d %d\n",c->num,c->tol);
}
| 14 |
6,705 | struct student
{
int xuehao;
int shuxue;
int yuwen;
int zongfen;
};
int main()
{
int n,i,e,j;
scanf("%d", &n);
struct student stu[100001];
for(i=0;i<n;i++)
{
scanf("%d %d %d", &stu[i].xuehao,&stu[i].shuxue,&stu[i].yuwen);
stu[i].zongfen=stu[i].shuxue+stu[i].yuwen;
}
for(i=1;i<4;i++)
{
for(j=0;j<n-i;j++)
{
if(stu[j].zongfen>=stu[j+1].zongfen)
{
stu[100000]=stu[j+1];
stu[j+1]=stu[j];
stu[j]=stu[100000];
}
}
}
for(i=n-1;i>n-4;i--)
{
printf("%d %d\n", stu[i].xuehao,stu[i].zongfen);
}
return 0;
} | 14 |
6,706 |
int main()
{
int n,i;
int fir=0,sec=0,thi=0;
int fir_n=0,sec_n=0,thi_n=0;
struct
{
int num;
int ma;
int cn;
int score;
}s;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&s.num,&s.ma,&s.cn);
s.score=s.ma+s.cn;
if(s.score>fir)
{
thi=sec;
thi_n=sec_n;
sec=fir;
sec_n=fir_n;
fir=s.score;
fir_n=s.num;
}
else if(s.score>sec)
{
thi=sec;
thi_n=sec_n;
sec=s.score;
sec_n=s.num;
}
else if(s.score>thi)
{
thi=s.score;
thi_n=s.num;
}
}
printf("%d %d\n",fir_n,fir);
printf("%d %d\n",sec_n,sec);
printf("%d %d\n",thi_n,thi);
return 0;
}
| 14 |
6,707 | int main(int argc, char* argv[])
{
struct student
{int id;
int x;
int y;
int z;
}student1,student2,student3,studenta;
int n,i;
scanf("%d",&n);
student1.z=student2.z=student3.z=0;
for(i=0;i<n;i++){
scanf("%d%d%d",&studenta.id,&studenta.x,&studenta.y);
studenta.z=studenta.x+studenta.y;
if(studenta.z>student1.z){
student3.z=student2.z;student3.id=student2.id;
student2.z=student1.z;student2.id=student1.id;
student1.z=studenta.z;student1.id=studenta.id;
}
else if(studenta.z>student2.z){
student3.z=student2.z;student3.id=student2.id;
student2.z=studenta.z;student2.id=studenta.id;
}
else if(studenta.z>student3.z){
student3.z=studenta.z;student3.id=studenta.id;
}
}
printf("%d %d\n%d %d\n%d %d\n",student1.id,student1.z,student2.id,student2.z,student3.id,student3.z);
return 0;
} | 14 |
6,708 | typedef struct st
{
int a,b;
} stu ;
stu s[100000];
int comp(const void *a,const void *b)
{
return ((stu*)b)->b-((stu*)a)->b;
}
int main()
{
int i,n,a,b;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&s[i].a,&a,&b);
s[i].b=a+b;
}
qsort(s,n,sizeof(stu),comp);
printf("%d %d\n%d %d\n%d %d",s[0].a,s[0].b,s[1].a,s[1].b,s[2].a,s[2].b);
//getch();
return 0;
}
| 14 |
6,709 | struct student
{
char xuehao[100];
int yuwen;
int shuxue;
int sum;
};
int main()
{
int n,i,j,l,m;
struct student stu[100000];
struct student temp;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s",stu[i].xuehao);
scanf("%d %d",&stu[i].yuwen,&stu[i].shuxue);
stu[i].sum=stu[i].yuwen+stu[i].shuxue;
}
for(j=1;j<4;j++)
{
for(m=0;m<n-j;m++)
{
if(stu[m].sum>=stu[m+1].sum)
{
temp=stu[m];
stu[m]=stu[m+1];
stu[m+1]=temp;
}
}
}
for(l=n-1;l>n-4;l--)
printf("%s %d\n",stu[l].xuehao,stu[l].sum);
return 0;
}
| 14 |
6,710 | struct student
{
int num;
int s1;
int s2;
int sum;
};
struct student stu[100000];
int main()
{
int n,i,p,q,r,max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[i].num,&stu[i].s1,&stu[i].s2);
stu[i].sum=stu[i].s1+stu[i].s2;
}
max=0;
for(i=0;i<n;i++)
{
if(stu[i].sum>max)
{
max=stu[i].sum;
p=i;
}
}
max=0;
for(i=0;i<n;i++)
{
if(i!=p)
{
if(stu[i].sum>max)
{
max=stu[i].sum;
q=i;
}
}
}
max=0;
for(i=0;i<n;i++)
{
if((i!=p)&&(i!=q))
{
if(stu[i].sum>max)
{
max=stu[i].sum;
r=i;
}
}
}
printf("%d %d\n",stu[p].num,stu[p].sum);
printf("%d %d\n",stu[q].num,stu[q].sum);
printf("%d %d\n",stu[r].num,stu[r].sum);
return 0;
}
| 14 |
6,711 | struct Student
{
int num;
int chi;
int math;
int total;
}person[100000],first[3]={{0,0,0,0},{0,0,0,0},{0,0,0,0}};
int main()
{
long n;
int i,j;
scanf("%ld",&n);
for(i=0;i<n;i++)
{
scanf("%ld%d%d",&person[i].num,&person[i].chi,&person[i].math);
person[i].total=person[i].chi+person[i].math;
if(person[i].total>first[0].total){first[1]=first[0];first[0]=person[i];}
else
if(person[i].total>first[1].total){first[2]=first[1];first[1]=person[i];}
else
if(person[i].total>first[2].total){first[2]=person[i];}
}
for(j=0;j<3;j++)
{
printf("%ld %d\n",first[j].num,first[j].total);
}
}
| 14 |
6,712 | struct stu
{
char num[15];
int chinese;
int math;
int sum;
struct stu *next;
};
int n;
struct stu *creat(void)
{
struct stu *head,*p,*g,*h;
int i,j;
p=(struct stu*)malloc(LEN);
scanf ("%s %d %d",(*p).num,&(*p).chinese,&(*p).math);
(*p).sum=((*p).chinese+(*p).math);
for (i=0;;i++)
{
if (i==0) {head=p;(*p).next=NULL;}
else if (i<4)
{
for (h=head,j=0;j<i;j++)
{
if ((*p).sum>(*h).sum) break;
else {g=h; h=(*h).next;}
}
if (j==0) {(*p).next=head;head=p;}
else if (j==i) {(*g).next=p;(*p).next=NULL;}
else {(*g).next=p;(*p).next=h;}
}
else
{
for (h=head,j=0;j<3;j++)
{
if ((*p).sum>(*h).sum) break;
else {g=h; h=(*h).next;}
}
if (j==0) {(*p).next=head;head=p;}
else {(*g).next=p;(*p).next=h;}
}
if (i==n-1) break;
p=(struct stu*)malloc(LEN);
scanf ("%s %d %d",(*p).num,&(*p).chinese,&(*p).math);
(*p).sum=((*p).chinese+(*p).math);
}
return(head);
}
void print(struct stu *head)
{
struct stu *p;
int i;
for (p=head,i=0;i<3;i++,p=(*p).next)
printf("%s %d\n",(*p).num,(*p).sum);
}
void main()
{
struct stu *head;
scanf("%d",&n);
head=creat();
print(head);
} | 14 |
6,713 | struct student
{
int id;
int chinese;
int math;
int sum;
struct student* next;
};
int n;
struct student *creat()
{
struct student *head,*p1,*p2;
p1=p2=(struct student*)malloc(len);
scanf("%d",&n);
scanf("%d%d%d",&p1->id,&p1->chinese,&p1->math);
p1->sum=p1->chinese+p1->math;
head=NULL;
for(;p1->id<n;)
{
if(p1->id==1) head=p1;
p1=(struct student*)malloc(len);
scanf("%d%d%d",&p1->id,&p1->chinese,&p1->math);
p1->sum=p1->chinese+p1->math;
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return(head);
}
void main()
{
struct student *head,*p1,*p2,*p3,*p;
head=creat();
for(p=head,p1=head,p2=head,p3=head;p!=NULL;p=p->next)
{
if(p->sum>p1->sum)
{
p3=p2;
p2=p1;
p1=p;
}
else if(p->sum>p2->sum)
{
p3=p2;
p2=p;
}
else if(p->sum>p3->sum)
{
p3=p;
}
}
printf("%d %d\n",p1->id,p1->sum);
printf("%d %d\n",p2->id,p2->sum);
printf("%d %d\n",p3->id,p3->sum);
}
| 14 |
6,714 | struct Student
{
int num;
int chinese;
int math;
int score;
};
int main()
{
int n;
int i,k,j;
struct Student student[100000];
struct Student temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&student[i].num);
scanf("%d",&student[i].chinese);
scanf("%d",&student[i].math);
student[i].score=student[i].chinese+student[i].math;
}
for(i=0;i<3;i++)
{
k=i;
for(j=i+1;j<n;j++)
{
if(student[j].score>student[k].score) k=j;
}
if(k!=i)
{
temp=student[i];
student[i]=student[k];
student[k]=temp;
}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",student[i].num,student[i].score);
}
return 0;
} | 14 |
6,715 | struct stu
{
int id;
int sum;
struct stu *next;
};
void main()
{
struct stu *head,*p1,*p2,*p0;
int n,i,ch,ma,len;
scanf("%d",&n);
len = sizeof (struct stu);
p1 = p2 = (struct stu*)malloc(len);
head = p1;
scanf("%d%d%d",&p1->id,&ch,&ma);
p1->sum = ch + ma;
p1->next = 0;
for (i=2;i<=n;i++)
{
p0 = (struct stu*)malloc(len);
scanf("%d %d %d",&p0->id,&ch,&ma);
p0->sum = ch + ma;
p1=p2=head;
while ( (p0->sum <= p1->sum) && (p1->next != 0) )
{
p2 = p1;
p1 = p1->next;
}
if (p0->sum > p1->sum)
{
if (head == p1)
head = p0;
else p2->next = p0;
p0->next = p1;
}
else
{
p1->next = p0;
p0->next = 0;
}
if (i>3)
{
p1 = head->next;
p1 = p1->next;
p1->next = 0;
}
}
p1 = head;
while (p1!=0)
{
printf("%d %d\n",p1->id,p1->sum);
p1 = p1->next;
}
}
| 14 |
6,716 | struct student
{
int num;
int yuwen;
int shuxue;
int total;
}stu[100000];
void main()
{
int n,i,j,k;
struct student temp;
scanf("%d\n",&n);
for(i=0;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;}
for(i=0;i<n-1;i++)
{
k=i;
for(j=i+1;j<n;j++)
{if(stu[j].total>stu[i].total)
{k=j;
temp=stu[k];stu[k]=stu[i];stu[i]=temp;}
}if(i==3)break;
}
for(i=0;i<3;i++)
printf("%d %d\n",stu[i].num,stu[i].total);
} | 14 |
6,717 |
struct student
{
int num;
int yuwen;
int shuxue;
int total;
struct student *next;
};
void main()
{
struct student *head,*p1,*p2,*P;
int n,i=0,j=0;
scanf("%d\n",&n);
p1=p2=head=(struct student *)malloc(LEN);
for(i=0;i<n;i++)
{
p2=p1;
scanf("%d%d%d",&p1->num,&p1->yuwen,&p1->shuxue);
p1->total=p1->yuwen+p1->shuxue;
p2->next=p1=(struct student *)malloc(LEN);
}
p2->next=head;
p1=head;
for(i=0;;)
{
if(j==3)break;
head=p1;
P=p1;
p1=head->next;
while(p1!=head)
{
if (p1->total>P->total) P=p1;
else if(p1->total==P->total && p1->num<P->num) P=p1;
p1=p1->next;
}
printf("%d %d\n", P->num,P->total);
while(p1->next!=P) p1=p1->next;
p1->next=P->next;//??P??
j++;
}
}
| 14 |
6,718 | struct student
{
int num;
int yu;
int shu;
struct student *next;
};
void main()
{
struct student *head,*p1,*p2;
int n,i,j,k;
scanf("%d",&n);
head=p1=p2=(struct student*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->yu,&p1->shu);
for(i=1;i<n;i++)
{
p1=(struct student*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->yu,&p1->shu);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
for(i=1;i<=3;i++)
{ p1=p2=head;
while(p1!=NULL)
{
if(p1->yu+p1->shu>p2->yu+p2->shu)
p2=p1;
p1=p1->next;
}
printf("%d %d\n",p2->num,p2->yu+p2->shu);
p2->yu=0;
p2->shu=0;
}
}
| 14 |
6,719 | main()
{
struct stdudent
{
int ID;
int a;
int b;
int c;
}d[100000];
int first,second,third;
int n,i,j;
int w,h,l;
int k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&d[i].ID,&d[i].a,&d[i].b);
d[i].c=d[i].a+d[i].b;
}
first=0;
second=1;
third=2;
w=d[0].c;
h=d[1].c;
l=d[2].c;
if(w<h&&(h>l))
{
first=1;
if(w>l)
{
second=0;
third=2;
}
else
{
second=2;
third=0;
}
}
else if(l>w)
{
first=2;
if(w>h)
{
second=0;
third=1;
}
else
third=0;
}
for(j=3;j<n;j++)
{
k=d[j].c;
w=d[first].c;
h=d[second].c;
l=d[third].c;
if(k>w)
{
third=second;
second=first;
first=j;
}
else if(k>h)
{
third=second;
second=j;
}
else if(k>l)
third=j;
}
printf("%d %d\n",d[first].ID,d[first].c);
printf("%d %d\n",d[second].ID,d[second].c);
printf("%d %d\n",d[third].ID,d[third].c);
getchar();
getchar();
}
| 14 |
6,720 | void main()
{
struct s
{
int a;
int b;
int c;
int d;
struct s *next;
};
struct s *p1,*p2,*head;
int i,j,k,m,n,t;
scanf("%d",&n);
p1=p2=(struct s *)malloc(sizeof(struct s));
head=p1;
scanf("%d %d %d",&p1->a,&p1->b,&p1->c);
for(i=0;i<n-1;i++)
{
p1=(struct s *)malloc(sizeof(struct s));
p2->next=p1;
p2=p1;
scanf("%d %d %d",&p1->a,&p1->b,&p1->c);
}
p2->next=0;
p1=p2=head;
for(i=0;i<n;i++)
{
p1->d=p1->b+p1->c;
p1=p1->next;
}
p1=head;
p2=p1->next;
for(j=0;j<3;j++)
{
p1=head;p2=p1->next;
for(i=0;i<n-2;i++)
{
if(p1->d<p2->d)
{
t=p1->d;
p1->d=p2->d;
p2->d=t;
k=p1->a;
p1->a=p2->a;
p2->a=k;
}
p2=p2->next;
}
p1=head;
printf("%d %d\n",p1->a,p1->d);
p1->d=0;
}
} | 14 |
6,721 | int b[100000];
struct student
{ int num;
int score1;
int score2;
}a[100000];
void main()
{ int max(int b[],int n);
int i,j=0,n,c;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d%d%d",&a[i].num,&a[i].score1,&a[i].score2);
b[i]=a[i].score1+a[i].score2;
}
while(j<3)
{
c=max(b,n) ;
for (i=0;i<n;i++)
{
if (b[i]==c)
{
printf("%d %d\n",a[i].num,b[i]);
b[i]=0;j=j+1;
if (j==3) break;
}
}
}
}
int max(int b[],int n)
{
int c,i;
c=b[0];
for (i=0;i<n;i++)
{
if (c<b[i])
c=b[i];
}
return(c);
}
| 14 |
6,722 | struct stu
{ int id;
int chn;
int math;
int sum;
};
int main()
{ struct stu indi[100000];
int n,i,j,rank[3];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&indi[i].id,&indi[i].chn,&indi[i].math);
indi[i].sum=indi[i].chn+indi[i].math;
}
for(i=0;i<3;i++){
rank[i]=0;
for(j=0;j<n;j++){
if(indi[j].sum>indi[rank[i]].sum)
rank[i]=j;
}
indi[rank[i]].sum=-indi[rank[i]].sum;
}
for(i=0;i<3;i++){
printf("%d %d\n",indi[rank[i]].id,-indi[rank[i]].sum);
}
return 0;
}
| 14 |
6,723 | struct student
{
char num[10];
float a,b,c;
int t;
struct student *next;
};
int n;
struct student *head;
struct student *creat()
{
struct student *p1,*p2;
int i;
i=0;
p1=p2=(struct student *)malloc(len);
scanf("%s %f %f",&p1->num,&p1->a,&p1->b);
p1->c=p1->a+p1->b;
p1->t=0;
head=null;
while (i<n-1)
{
i++;
if (i==1) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(len);
scanf("%s %f %f",&p1->num,&p1->a,&p1->b);
p1->c=p1->a+p1->b;
p1->t=0;
}
p2->next=p1;
p1->next=null;
return(head);
}
void max()
{
struct student *p1,*p2;
float mm=0;
p1=head;
for (;p1!=null;)
{
if (p1->c>mm&&p1->t==0)
{
mm=p1->c;
p2=p1;
}
p1=p1->next;
}
printf("%s %g\n",p2->num,p2->c);
p2->t=1;
}
main()
{
int i,j;
struct student *p;
void max();
scanf("%d",&n);
creat();
max();
max();
max();
} | 14 |
6,724 | int n,i,max=0,d,t=0;
struct stu
{
int id;
int chi;
int ma;
struct stu *next;
} *p1,*p2;
struct stu *creat(void)
{
struct stu *head;
scanf("%d",&n);
p2=p1=(struct stu *)malloc(sizeof(struct stu));
for(i=0;i<n;i++)
{
scanf("%d %d %d",&p1->id,&p1->chi,&p1->ma);
if(i==0) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct stu *)malloc(sizeof(struct stu));
}
p2->next=NULL;
return (head);
}
void find (struct stu *head)
{
while(t<3)
{
p1=head;
for(i=0;i<n;i++)
{
if(p1->chi+p1->ma>max)
{
max=p1->chi+p1->ma;
d=p1->id;
}
p1=p1->next;
}
printf("%d %d\n",d,max);
t=t+1; max=0;
p1=head;
for(i=0;i<n;i++)
{
if(p1->id==d)
{
p1->chi=0;
p1->ma=0;
}
p1=p1->next;
}
}
}
void main()
{
struct stu *head;
head=creat();
find(head);
}
| 14 |
6,725 | int sum[1000000];
struct student{
int id;
int Gra[2];
}stu[1000000];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>stu[i].id>>stu[i].Gra[0]>>stu[i].Gra[1];
sum[i]=stu[i].Gra[0]+stu[i].Gra[1];
}
int max=0,imax=0;
for(int i=0;i<3;i++)
{ max=0;
for(int j=0;j<n;j++)
if(max<sum[j]) {max=sum[j];imax=j;}
cout<<stu[imax].id<<" "<<sum[imax]<<endl;
sum[imax]=0;
}
return 0;
}
| 14 |
6,726 |
int main(int argc, char* argv[])
{
int n,max,m;
scanf("%d",&n);
struct stu{
int hao,yuwen,shuxue,zong;
}stu[100000];
int i,j;
for(i=0;i<n;i++)
{
scanf("%d""%d""%d",&stu[i].hao,&stu[i].yuwen,&stu[i].shuxue);
stu[i].zong=stu[i].yuwen+stu[i].shuxue;
}
for(i=0;i<3;i++)
{
max=stu[0].zong;
for(j=1;j<n;j++)
{
if(stu[j].zong>max)
{
max=stu[j].zong;
m=j;
}
}printf("%d %d\n",stu[m].hao,max);
stu[m].zong=0;
}
return 0;
} | 14 |
6,727 | struct student
{
int num;
int chinese;
int math;
int sum;
};
void main()
{
int n,i,j;
struct student stu[100000];
struct student stud;
scanf("%d",&n);
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;
}
for(i=0;i<3;i++)
{
for(j=i+1;j<n;j++)
{
if(stu[i].sum<stu[j].sum)
{
stud=stu[i];
stu[i]=stu[j];
stu[j]=stud;
}
}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",stu[i].num,stu[i].sum);
}
}
| 14 |
6,728 | int main()
{
int n;
scanf("%d",&n);
struct student{
int num;
int chi;
int math;
int sum;
};
struct student*fig;
fig=(struct student*)malloc(sizeof(student)*n);
int i,a=0,b=0,c=0,numa=0,numb=0,numc=0;
for(i=0;i<n;i++)
{
scanf("%d%d%d",&(fig+i)->num,&(fig+i)->chi,&(fig+i)->math);
(fig+i)->sum=(fig+i)->chi+(fig+i)->math;
if((fig+i)->sum>a)
{
c=b;
numc=numb;
b=a;
numb=numa;
a=(fig+i)->sum;
numa=(fig+i)->num;
}
else if((fig+i)->sum>b)
{
c=b;
numc=numb;
b=(fig+i)->sum;
numb=(fig+i)->num;
}
else if((fig+i)->sum>c)
{
c=(fig+i)->sum;
numc=(fig+i)->num;
}
}
printf("%d %d\n%d %d\n%d %d\n",numa,a,numb,b,numc,c);
return 0;
}
| 14 |
6,729 | struct student
{
int number;
int total;
};
int main()
{
int n;
cin>>n;
struct student a[n];
int i,j,t;
for(i=0;i<n;i++)
{int b,c;
cin>>a[i].number>>b>>c;
a[i].total=b+c;
}
for(i=0;i<3;i++)
{
for(j=i;j<n;j++)
{
if(a[j].total>a[i].total)
{
t=a[i].total;a[i].total=a[j].total;a[j].total=t;
t=a[i].number;a[i].number=a[j].number;a[j].number=t;
}
}
}
for(i=0;i<3;i++)
cout<<a[i].number<<' '<<a[i].total<<endl;
return 0;
}
| 14 |
6,730 | struct Student
{int ID;
int chi;
int math;
int total;
};
int main()
{
struct Student stu[100000];
struct Student temp;
int i,n,j,m;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&stu[i].ID,&stu[i].chi,&stu[i].math);
stu[i].total=stu[i].chi+stu[i].math;
}
for(j=1;j<4;j++){
for(m=0;m<n-j;m++){
if(stu[m].total>=stu[m+1].total){
temp=stu[m];
stu[m]=stu[m+1];
stu[m+1]=temp;
}
}
}
for(i=n-1;i>n-4;i--)
printf("%d %d\n",stu[i].ID,stu[i].total);
return 0;
}
| 14 |
6,731 | struct student
{
int num;
int yw;
int sx;
int he;
}student[100000];
int main()
{
int i,n,j,s=0,m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&student[i].num,&student[i].yw,&student[i].sx);
student[i].he=student[i].yw+student[i].sx;
}
for(i=0;i<n;i++)
{m=student[0].he;
for(j=n-1;j>0;j--)
{
m=student[j].he>m?student[j].he:m;
}
for(j=0;j<n;j++)
{
if(student[j].he==m)
{printf("%d %d\n",student[j].num,student[j].he);
student[j].he=0;s=s+1;if(s==3)
{goto guiyi;}}
}
}
guiyi: return 0;
} | 14 |
6,732 | void main()
{
struct student
{
int ID;
int mark1;
int mark2;
int total;
}student[100000],temp;
int n,k,m;
scanf("%d",&n);
for(k=0;k<n;k++)
{
scanf("%d%d%d",&student[k].ID,&student[k].mark1,&student[k].mark2);
student[k].total=student[k].mark1+student[k].mark2;
}
for(m=0;m<3;m++)
{
for(k=n-1;k>=m;k--)
{
if(student[k].total>student[k-1].total)
{
temp=student[k-1];
student[k-1]=student[k];
student[k]=temp;
}
}
}
printf("%d %d\n%d %d\n%d %d\n",student[0].ID,student[0].total,student[1].ID,student[1].total,student[2].ID,student[2].total);
} | 14 |
6,733 | struct stu
{
int num;
struct stu *next;
};
void main()
{
int i=0,n,a,b,score,first=0,second=0,third=0;
struct stu *head,*p,*p1,*p2,*p3;
scanf("%d",&n);
head=p=(struct stu *)malloc(sizeof(struct stu));
while(i++<n)
{
scanf("%d %d %d",&(*p).num,&a,&b);
score=a+b;
if(score>first)
{
third=second;second=first;first=score;
p3=p2;p2=p1;p1=p;
}
else if(score>second){third=second;second=score;p3=p2;p2=p;}
else if(score>third){third=score;p3=p;}
p=(*p).next=(struct stu *)malloc(sizeof(struct stu));
}
printf("%d %d\n%d %d\n%d %d\n",(*p1).num,first,(*p2).num,second,(*p3).num,third);
} | 14 |
6,734 | struct student
{
int num;
int score1;
int score2;
int sum;
struct student *next;
struct student *before;
};
main()
{
int i,n,n1=0,n2=0,n3=0,m1=0,m2=0,m3=0;
struct student *head;
struct student *p1,*p2;
scanf("%d",&n);
p1=p2=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->score1,&p1->score1);
p1->sum=p1->score1+p1->score2;
m1=p1->sum;
n1=p1->num;
head=0;
i=0;
while(i<=n-2)
{
i++;
if(i==1)
head=p1;
else
{
p1->before=p2;
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;
if(p1->sum>m3 && p1->sum<=m2)
{
m3=p1->sum;
n3=p1->num;
}
if(p1->sum>m2 && p1->sum<=m1)
{
m3=m2;
n3=n2;
m2=p1->sum;
n2=p1->num;
}
if(p1->sum>m1)
{
m3=m2;
n3=n2;
m2=m1;
n2=n1;
m1=p1->sum;
n1=p1->num;
}
}
printf("%d %d\n",n1,m1);
printf("%d %d\n",n2,m2);
printf("%d %d\n",n3,m3);
} | 14 |
6,735 | struct student
{
int num;
float yuwen;
float shuxue;
float zongfen;
}stu[student_num],*p[3];
void main()
{
void paixu(struct student *a,int n);
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%f%f",&stu[i].num,&stu[i].yuwen,&stu[i].shuxue);
stu[i].zongfen=stu[i].yuwen+stu[i].shuxue;
}
paixu(stu,n);
for(i=0;i<3;i++)printf("%d %.0f\n",p[i]->num,p[i]->zongfen);
}
void paixu(struct student *a,int n)
{
int i,j;
float x[3];
for(i=0;i<3;i++)
{
for(j=1,p[i]=a;j<n;j++)if(p[i]->zongfen<(a+j)->zongfen)p[i]=a+j;
x[i]=p[i]->zongfen;
p[i]->zongfen=0;
}
for(i=0;i<3;i++)p[i]->zongfen=x[i];
} | 14 |
6,736 | struct info
{
int num;
int chin;
int math;
struct info *next;
};
struct info *create(int n)
{
int i;
struct info *head,*p1,*p2;
p1=(struct info*)malloc(sizeof(struct info));
scanf("%d %d %d",&p1->num,&p1->chin,&p1->math);
p1->next=NULL;
head=p1;
p2=p1;
i=1;
do
{
p1=(struct info*)malloc(sizeof(struct info));
scanf("%d %d %d",&p1->num,&p1->chin,&p1->math);
p1->next=NULL;
p2->next=p1;
p2=p1;
i++;
}while(i<n);
return(head);
}
void arrange(struct info *head)
{
int m,no1,no2,no3;
struct info *p;
p=head;
m=0;
while(p)
{
if (p->chin+p->math>m)
{m=p->chin+p->math;no1=p->num;}
p=p->next;
}
printf("%d %d\n",no1,m);
m=0;
p=head;
no2=p->num;
while(p)
{
if (p->chin+p->math>m&&p->num!=no1)
{m=p->chin+p->math;no2=p->num;}
p=p->next;
}
printf("%d %d\n",no2,m);
m=0;
p=head;
no3=p->num;
while(p)
{
if (p->chin+p->math>m&&p->num!=no1&&p->num!=no2)
{m=p->chin+p->math;no3=p->num;}
p=p->next;
}
printf("%d %d\n",no3,m);
}
int main()
{
int n;
struct info *head;
scanf("%d",&n);
head=create(n);
arrange(head);
}
| 14 |
6,737 | struct student
{
int num;
int yw;
int sx;
};
int main()
{
int n,i,x=0,y=0,z=0;
scanf("%d",&n);
struct student a[n];
int b[n];
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a[i].num,&a[i].yw,&a[i].sx);
b[i]=a[i].yw+a[i].sx;
}
for(i=1;i<n;i++)
{
if(b[x]<b[i])
x=i;
}
printf("%d %d\n",a[x].num,b[x]);
for(i=1;i<n;i++)
{
if(i==x) continue;
if(b[y]<b[i])
y=i;
}
printf("%d %d\n",a[y].num,b[y]);
for(i=1;i<n;i++)
{
if(i==x) continue;
if(i==y) continue;
if(b[z]<b[i])
z=i;
}
printf("%d %d\n",a[z].num,b[z]);
getchar();
getchar();
} | 14 |
6,738 | int sum[99999];
int m[99999];
int main(int argc, char* argv[])
{
int n,i,b,c,a;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a,&b,&c);
sum[i]=b+c;
m[i]=a;
}
int j,k,t,x,l=0;
for(j=0;j<n;j++)
{
for(k=n-1;k>j;k--)
{
if(sum[k]>sum[k-1])
{
t=sum[k-1];
sum[k-1]=sum[k];
sum[k]=t;
x=m[k-1];
m[k-1]=m[k];
m[k]=x;
}
}l++;
if(l==3)
break;
}
for(i=0;i<l;i++)
{
printf("%d %d\n",m[i],sum[i]);
}
return 0;
}
| 14 |
6,739 | struct student
{
int num;
int yu;
int shu;
struct student *next;
};
int n;
struct student *creat(void)
{
int i;
struct student *head;
struct student *p1,*p2;
scanf("%d",&n);
p1=p2=(struct student*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->yu,&p1->shu);
head=p1;
for(i=1;i<=n-1;i++)
{
p1=(struct student*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->yu,&p1->shu);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return(head);
}
void main()
{
int i,j,k=0;
struct student *head;
struct student *p1,*p2;
head=creat();
p1=head;
for(j=1;j<=3;j++)
{
p1=p2=head;
for(i=1;i<=n-j;i++)
{
if( (p1->yu+p1->shu)>k )
k=p1->yu+p1->shu;
p1=p1->next;
}
p1=p2=head;
if((head->yu+head->shu)==k)
{
printf("%d %d",p1->num,p1->yu+p1->shu);
head=head->next;
}
else
{
for(i=1;;i++)
{
if( (p1->yu+p1->shu)==k )
{
printf("%d %d\n",p1->num,p1->yu+p1->shu);
//printf("%d \n",p2->num);
if((p1->next)!=NULL)
p2->next=p1->next;
else p2->next=NULL;
k=0;
break;
}
p2=p1;
p1=p1->next;
}
}
}
}
| 14 |
6,740 | //????????????
//??????
//?????2010-12-24
//????????????????????????
int main()
{
int n,i,j,x,y;
struct student
{
int score,num;
} //???????????
a[100000];
cin>>n;
for (i=1;i<=n;i++) {cin>>a[i].num>>x>>y;a[i].score=x+y;}
a[0]=a[1];
for (i=1;i<=3;i++)//??
for(j=i+1;j<=n;j++)
if (a[i].score<a[j].score) {a[0]=a[i];a[i]=a[j];a[j]=a[0];}
cout<<a[1].num<<" "<<a[1].score<<endl<<a[2].num<<" "<<a[2].score<<endl<<a[3].num<<" "<<a[3].score;
}
| 14 |
6,741 | struct student
{
int n1;
int n2;
int n3;
struct student *next;
};
void main()
{
struct student *p,*head,*tail;
int n,i,sum[100000],max1,max2,max3,k1,k2,k3;
scanf("%d",&n);
head=NULL;tail=NULL;
for(i=1;i<=n;i++)
{
p=(struct student*)malloc(len);
scanf("%d%d%d",&p->n1,&p->n2,&p->n3);
if(head==NULL)
head=tail=p;
else
{
tail->next=p;
tail=p;}
sum[i]=p->n2+p->n3;
}
max1=sum[1];k1=1;
for(i=1;i<=n;i++)
if(sum[i]>max1) {max1=sum[i];k1=i;}
sum[k1]=0;
max2=sum[1];k2=1;
for(i=1;i<=n;i++)
if(sum[i]>max2) {max2=sum[i];k2=i;}
sum[k2]=0;
max3=sum[1];k3=1;
for(i=1;i<=n;i++)
if(sum[i]>max3) {max3=sum[i];k3=i;}
printf("%d %d\n%d %d\n%d %d\n",k1,max1,k2,max2,k3,max3);
}
| 14 |
6,742 | struct stu
{
long num,ch,ma,tot;
struct stu *next;
};
int main()
{
int n,numt,cht,mat;
scanf("%d",&n);
struct stu *head,*now,*neww,*max;
int i;
for (i=1;i<=n;i++)
{
neww=(struct stu*) malloc (sizeof(struct stu));
neww->next=0;
if (i==1)
{head=neww;
now=neww;}
else
{
now->next=neww;
now=neww;
}
scanf("%ld %ld %ld",&now->num,&now->ch,&now->ma);
now->tot=now->ch + now->ma;
}
for (i=1;i<=3;i++)
{
now=head;
max=now;
while (now->next!=0)
{
if (max->tot<now->tot) max=now;
now=now->next;
}
printf("%d %d\n",max->num,max->tot);
max->tot=-1;
}
// scanf("%ld %ld %ld",&now->num,&now->ch,&now->ma);
return 0;
}
| 14 |
6,743 |
struct student
{
int id;
int ch;
int math;
};
int main()
{
int max(int *p,int n);
void shuchu(int *p,int n,int k,struct student student[100001]);
struct student student[100001];
int n,i,*p,k;
p=(int *)calloc(100001,sizeof(int));
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&student[i].id,&student[i].ch,&student[i].math);
(*(p+i))=(student[i].ch+student[i].math);
}
k=max(p,n);
shuchu(p,n,k,student);
k=max(p,n);
shuchu(p,n,k,student);
k=max(p,n);
shuchu(p,n,k,student);
return 0;
}
int max(int *p,int n)
{
int k=0,i;
for(i=0;i<n;i++)
{
if((*(p+i))>k)
k=(*(p+i));
}
return (k);
}
void shuchu(int *p,int n,int k,struct student student[100001])
{
int i;
for(i=0;i<n;i++)
{
if((*(p+i))==k)
{
printf("%d %d\n",student[i].id,k);
(*(p+i))=0;
break;
}
}
} | 14 |
6,744 | int main()
{
struct a
{
int h;
int y;
int s;
}b[100000],e;
int c[100000];
int n,i,f,j,d;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&b[i].h,&b[i].y,&b[i].s);
}
for(i=0;i<n;i++)
{
c[i]=b[i].y+b[i].s;
}
for(j=0;j<3;j++)
{
for(i=j+1;i<n;i++)
{
if(c[i]>c[j])
{
d=c[j];
c[j]=c[i];
c[i]=d;
e=b[j];
b[j]=b[i];
b[i]=e;
}
}
f=b[j].h;
printf("%d %d\n",f,c[j]);
}
return 0;
} | 14 |
6,745 | /*
* 1000012826_????????.cpp
*
* Created on: 2010-12-24
* Author: Administrator
*/
struct Student{
int num;
int mscore;
int cscore;
int total;
}stu[100001];
int main(){
int n,i,m=0,b[201][100]={0},a[201][100]={0},j=200,count=3,k=0,c[201]={0};
cin>>n;
for(i=0;i<n;i++){
cin>>stu[i].num;
cin>>stu[i].mscore;
cin>>stu[i].cscore;
stu[i].total=stu[i].mscore+stu[i].cscore;
}
do{
b[stu[m].total][c[stu[m].total]]=stu[m].total;//??????? ,c?stu[m].total????????
a[stu[m].total][c[stu[m].total]]=stu[m].num;//?????????
if(c[stu[m].total]<4)c[stu[m].total]++;//???????
m++;
}while(m<n);
for(j=200;j>=0;j--){
for(k=0;k<100&&count>0;k++){
if(b[j][k]!=0){
cout<<a[j][k]<<" "<<b[j][k]<<endl;
count--;}//??????
}
}
} | 14 |
6,746 |
struct student{
int No;
int Chinese;
int math;
int score;
}stu[100000];
int main(){
int n,i,j,a,b;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&stu[i].No,&stu[i].Chinese,&stu[i].math);
stu[i].score=stu[i].Chinese+stu[i].math;
}
for(j=n-1;j>n-4;j--){
for(i=0;i<j;i++){
if(stu[i+1].score<stu[i].score||stu[i+1].score==stu[i].score){
a=stu[i+1].score;
stu[i+1].score=stu[i].score;
stu[i].score=a;
b=stu[i+1].No;
stu[i+1].No=stu[i].No;
stu[i].No=b;
}
}
}
for(i=n-1;i>n-4;i--){
printf("%d %d\n",stu[i].No,stu[i].score);
}
return 0;
} | 14 |
6,747 | struct student
{
int num;
int chinese;
int math;
};
struct student stu[100000];
int sum[100000];
int main(int argc, char* argv[])
{
int a,b,c,num1,num2,num3;
int i,n;
scanf("%d",&n);
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++)
{
sum[i]=stu[i].chinese+stu[i].math;
}
a=sum[0];
num1=1;
if(a<sum[1])
{
b=a;
num2=num1;
a=sum[1];
num1=2;
}
else
{
b=sum[1];
num2=2;
}
c=0;
for(i=2;i<n;i++)
{
if(a<sum[i])
{
c=b;
num3=num2;
b=a;
num2=num1;
a=sum[i];
num1=i+1;
}
else
if(b<sum[i])
{
c=b;
num3=num2;
b=sum[i];
num2=i+1;
}
else
if(c<sum[i])
{
c=sum[i];
num3=i+1;
}
}
printf("%d %d\n",num1,a);
printf("%d %d\n",num2,b);
printf("%d %d\n",num3,c);
return 0;
}
| 14 |
6,748 | struct student
{
int name;
int ch;
int math;
};
struct student stu[100000];
int main()
{
int n; int sum[100000];int max[3];int i,j,k,m,o;int s;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d",&stu[i].name,&stu[i].ch,&stu[i].math);
for(i=0;i<n;i++)
{
sum[i]=stu[i].ch+stu[i].math;
}
//for(i=0;i<n;i++)
{
max[0]=0;
for(j=0,k=0;j<n;j++)
{if(sum[j]>max[0])
{max[0]=sum[j];
k=j;}
}
}
//for(i=0;i<n;i++)
{
max[1]=0;
for(j=1,m=0;j<n;j++)
{if((sum[j]>max[1])&&(j!=k))
{max[1]=sum[j];
m=j;}
}
}
//for(i=0;i<n;i++)
{
max[2]=0;
for(j=1,o=0;j<n;j++)
{if((sum[j]>max[2])&&(j!=k)&&(j!=m))
{max[2]=sum[j];
o=j;}
}
}
printf("%d %d\n",stu[k].name,sum[k]);
printf("%d %d\n",stu[m].name,sum[m]);
printf("%d %d\n",stu[o].name,sum[o]);
return 0;
} | 14 |
6,749 | struct student
{
int n;
int a;
int b;
int aver;
}stu[100000];
void main()
{
int m,i,j,f,t;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d%d%d",&stu[i].n,&stu[i].a,&stu[i].b);
}
for(i=0;i<m;i++)
{
stu[i].aver=stu[i].a+stu[i].b;
}
for(i=0;i<3;i++)
for(j=m-1-i;j>=0;j--)
{
if(stu[j].aver<stu[j+1].aver)
{
f=stu[j].aver;
stu[j].aver=stu[j+1].aver;
stu[j+1].aver=f;
t=stu[j].n;
stu[j].n=stu[j+1].n;
stu[j+1].n=t;
}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",stu[i].n,stu[i].aver);
}
}
| 14 |
6,750 |
int main()
{
int n,i;
int sum[100000];
int max1,max2,max3;
int x=0;
scanf("%d",&n);
struct {
int number;
int chin;
int math;
}student[100000];
for(i=0;i<n;i++){
scanf("%d%d%d",&student[i].number,&student[i].chin,&student[i].math);
sum[i]=student[i].chin+student[i].math;}
max1=sum[0];
max2=sum[0];
max3=sum[0];
for(i=0;i<n;i++){
if(sum[i]>max1)
max1=sum[i];}
for(i=0;i<n;i++){
if(sum[i]==max1){
printf("%d %d\n",student[i].number,sum[i]);
x++;}
if(x>=3)
break;
}
for(i=0;i<n;i++){
if((sum[i]>max2)&&(sum[i]!=max1))
max2=sum[i];}
for(i=0;i<n;i++){
if(x>=3)
break;
if(sum[i]==max2){
printf("%d %d\n",student[i].number,sum[i]);
x++;}
}
for(i=0;i<n;i++){
if((sum[i]>max3)&&(sum[i]!=max1)&&(sum[i]!=max2))
max3=sum[i];}
for(i=0;i<n;i++){
if(x>=3)
break;
if(sum[i]==max3){
printf("%d %d",student[i].number,sum[i]);
x++;}
}
return 0;
}
| 14 |
6,751 | struct Student
{
int num;
int math;
int chinese;
}stu[100000];
int main()
{
int n,i,j,s[100000],t[100000],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);
}
for(i=0;i<=(n-1);i++)
{
s[i]=stu[i].math+stu[i].chinese;
t[i]=s[i];
}
int p;
for(i=0;i<=2;i++)
{
for(j=0;j<=(n-i-2);j++)
{
if(s[j]>=s[j+1])
{
p=s[j];
s[j]=s[j+1];
s[j+1]=p;
}
}
}
int d[3];
for(i=0;i<=(n-1);i++)
{
if(t[i]==s[n-1])
{
printf("%d %d",stu[i].num,t[i]);
d[c]=stu[i].num;
printf("\n");
c=c+1;
if(c==3)break;
}
if(c==3)break;
}
for(i=0;i<=(n-1);i++)
{
if(t[i]==s[n-2])
{
if(stu[i].num==d[0]||stu[i].num==d[1]||stu[i].num==d[2])break;
printf("%d %d",stu[i].num,t[i]);
d[c]=stu[i].num;
printf("\n");
c=c+1;
if(c==3)break;
}
if(c==3)break;
}
for(i=0;i<=(n-1);i++)
{
if(t[i]==s[n-3])
{
if(stu[i].num==d[0]||stu[i].num==d[1]||stu[i].num==d[2])break;
printf("%d %d",stu[i].num,t[i]);
d[c]=stu[i].num;
printf("\n");
c=c+1;
if(c==3)break;
}
if(c==3)break;
}
return 0;
}
| 14 |
6,752 | int main()
{
int n,i,first,second,third,x,y,z;
scanf("%d",&n);
struct mark{
int ID,chinese,math,sum;
}*num;
num=(struct mark*)malloc(sizeof(mark)*n);
int n1,c1,m1;
for(i=0;i<n;i++)
{
scanf("%d %d %d",&n1,&c1,&m1);
num[i].ID =n1;
num[i].chinese =c1;
num[i].math=m1;
num[i].sum=c1+m1;
}
for(i=0;i<n;i++)
{
if(i==0)
{
first=num[i].sum;
second=num[i].sum;
third=num[i].sum;
x=num[i].ID;
y=num[i].ID;
z=num[i].ID ;
}
else if(i==1)
{
if(num[i].sum>first)
{
first=num[i].sum;
x=num[i].ID;
}
else
{
third=num[i].sum;
z=num[i].ID;
}
}
else
{
if(num[i].sum>first)
{
third=second;
z=y;
second=first;
y=x;
first=num[i].sum;
x=num[i].ID;
}
else if(num[i].sum>second)
{
third=second;
z=y;
second=num[i].sum;
y=num[i].ID;
}
else if(num[i].sum>third)
{
third=num[i].sum;
z=num[i].ID;
}
}
}
printf("%d %d\n%d %d\n%d %d\n",x,first,y,second,z,third);
return 0;
} | 14 |
6,753 |
struct student
{
long id;
int chinese;
int math;
int score;
struct student *next;
};
struct student *creat(void)
{
int num;
struct student *head,*p,*q;
q=NULL;
head=(struct student *)malloc(len);
p=head;
scanf("%d",&num);
while(num>0)
{
q=p;
scanf("%ld%d%d",&p->id,&p->chinese,&p->math);
p->score=p->chinese+p->math;
p=(struct student *)malloc(len);
q->next=p;
num--;
}
p->next=NULL;
return (head);
}
void main()
{
int i;
struct student *p,*head,*max[3];
head=creat();
p=head;
for(i=0;i<=2;i++)
{
max[i]=(struct student *)malloc(len);
max[i]->score=0;
}
for(;p!=NULL;p=p->next)
{
if(p->score>max[0]->score)
{
max[2]=max[1];
max[1]=max[0];
max[0]=p;
}
else if(p->score>max[1]->score)
{
max[2]=max[1];
max[1]=p;
}
else if(p->score>max[2]->score)
{
max[2]=p;
}
}
for(i=0;i<=2;i++)
{
printf("%ld %d\n",max[i]->id,max[i]->score);
}
} | 14 |
6,754 | /*????????
*?????
*???1000010549
*???2010-12-25
*/
struct student{
int num;
int scorec;
int scorem;
int score;
};
int main(){
int n;
int i;
struct student stu[100001];
int best[2][3]={{0,0,0},{0,0,0}};
cin>>n;
for(i=1;i<=n;i++)
{
cin>>stu[i].num>>stu[i].scorec>>stu[i].scorem;
stu[i].score=stu[i].scorec+stu[i].scorem;
}
for(i=1;i<=n;i++)
{
if(stu[i].score>best[1][0])
{
best[0][2]=best[0][1];
best[0][1]=best[0][0];
best[0][0]=stu[i].num;
best[1][2]=best[1][1];
best[1][1]=best[1][0];
best[1][0]=stu[i].score;
}
else if(stu[i].score<=best[1][0]&&stu[i].score>best[1][1])
{
best[0][2]=best[0][1];
best[0][1]=stu[i].num;
best[1][2]=best[1][1];
best[1][1]=stu[i].score;
}
else if(stu[i].score<=best[1][1]&&stu[i].score>best[1][2])
{
best[0][2]=stu[i].num;
best[1][2]=stu[i].score;
}
}
for(i=0;i<3;i++)
cout<<best[0][i]<<' '<<best[1][i]<<endl;
return 0;
}
| 14 |
6,755 | struct student
{
int id;
int yu;
int shu;
struct student *next;
};
void main()
{
int n,i,j=0;
struct student *head,*p1,*p2;
scanf("%d",&n);
head=p1=p2=(struct student *)malloc(LEN);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&p1->id,&p1->yu,&p1->shu);
p1=(struct student *)malloc(LEN);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
p1=head;
for(i=200;i>10;i--)
{
p1=head;
while(p1!=NULL)
{
if((p1->yu+p1->shu)==i)
{
printf("%d %d\n",p1->id,i);
j++;
}
p1=p1->next;
if(j==3)break;
}
if(j==3)break;
}
} | 14 |
6,756 |
int main()
{
struct student{
long num;
long chinese;
long maths;
long sum;
}t[100000];
long n,i,j,k,tmp;
scanf("%ld",&n);
for(i=0;i<n;i++)
{
scanf("%ld %ld %ld",&t[i].num,&t[i].chinese,&t[i].maths);
}
for(i=0;i<n;i++)
{
t[i].sum=t[i].chinese+t[i].maths;
}
for(i=0;i<3;i++)
{
k=i;
for(j=i+1;j<n;j++)
{
if(t[j].sum>t[k].sum)
k=j;
}
tmp=t[i].sum;
t[i].sum=t[k].sum;
t[k].sum=tmp;
tmp=t[i].num;
t[i].num=t[k].num;
t[k].num=tmp;
}
for(i=0;i<3;i++)
{
printf("%ld %ld\n",t[i].num,t[i].sum);
}
return 0;
} | 14 |
6,757 | struct stu
{
int num;
int yu;
int shu;
int tol;
struct stu *next;
};
int n;
struct stu *creat(void)
{
struct stu *p1,*p2,*head,*p;
int i,k;
p1=p2=(struct stu *)malloc(sizeof(struct stu));
scanf("%d %d %d",&p1->num,&p1->yu,&p1->shu);
p1->tol=p1->yu+p1->shu;
p1->next=0;
head=p1;
p=p1;
p1=(struct stu *)malloc(sizeof(struct stu));
for(i=1;i<n;i++)
{
p=head;
p2=p1;
k=0;
scanf("%d %d %d",&p1->num,&p1->yu,&p1->shu);
p1->tol=p1->yu+p1->shu;
while(p!=0&&p->tol>=p1->tol)
{
p2=p;
p=p->next;
k++;
}
if(k<=3)
{
if(p==head)
{
head=p1;
p1->next=p;
}
if(p==0)
{
p2->next=p1;
p1->next=0;
}
if(p!=head&&p!=0)
{
p2->next=p1;
p1->next=p;
}
}
p1=(struct stu *)malloc(sizeof(struct stu));
}
return head;
}
void main()
{
struct stu *head,*p;
int i=0;
scanf("%d",&n);
head=creat();
p=head;
while(i<3)
{
printf("%d %d\n",p->num,p->tol);
i++;
p=p->next;
}
} | 14 |
6,758 | struct Student
{
int No;
int Chinese;
int Maths;
int Total;
};
void bubble(struct Student a[],int n)
{
int i,j;
struct Student temp;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(a[j].Total<a[j+1].Total)
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
}
int main()
{
int n,i;
struct Student stu[4];
scanf("%d",&n);
if(n>3)
{
for(i=0;i<3;i++)
{
scanf("%d%d%d",&stu[i].No,&stu[i].Chinese,&stu[i].Maths);
stu[i].Total=stu[i].Chinese+stu[i].Maths;
}
for(i=3;i<n;i++)
{
scanf("%d%d%d",&stu[3].No,&stu[3].Chinese,&stu[3].Maths);
stu[3].Total=+stu[3].Chinese+stu[3].Maths;
bubble(stu,4);
}
}
else
{
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[i].No,&stu[i].Chinese,&stu[i].Maths);
stu[i].Total=stu[i].No+stu[i].Chinese+stu[i].Maths;
}
bubble(stu,n);
}
for(i=0;i<n&&i<3;i++)printf("%d %d\n",stu[i].No,stu[i].Total);
return 0;
}
| 14 |
6,759 | struct student{
int j;
int x,y;
int z;
}stu[100000];
int main(int argc, char* argv[])
{
int n,i,a=0,b=0,c=0,a1,b1,c1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[i].j,&stu[i].x,&stu[i].y);
stu[i].z=stu[i].x+stu[i].y;
}
for(i=0;i<n;i++)
{
if(a<stu[i].z)
{
a=stu[i].z;
a1=i;
}
}
for(i=0;i<n;i++)
{
if(b<stu[i].z&&i!=a1)
{
b=stu[i].z;
b1=i;
}
}
for(i=0;i<n;i++)
{
if(c<stu[i].z&&i!=a1&&i!=b1)
{
c=stu[i].z;
c1=i;
}
}
printf("%d %d\n%d %d\n%d %d\n",stu[a1].j,stu[a1].z,stu[b1].j,stu[b1].z,stu[c1].j,stu[c1].z);
return 0;
}
| 14 |
6,760 | 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=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,761 | int main()
{
int n,i,j,k,l,sum[100001],temp=0;
cin>>n;
struct student
{
int ID;
int chinese;
int math;
}person[100001];//???????,??ID?????????
for(i=1;i<=n;i++)
{
cin>>person[i].ID>>person[i].chinese>>person[i].math;
sum[i]=person[i].chinese+person[i].math;//????
}
for(i=1;i<=n;i++)
{
if(sum[i]>temp)
{
temp=sum[i];
j=i;//?????
}
}
temp=0;
for(i=1;i<=n;i++)
{
if(sum[i]>temp&&i!=j)//???
{
temp=sum[i];
k=i;
}
}
temp=0;
for(i=1;i<=n;i++)
{
if(sum[i]>temp&&i!=j&&i!=k)//???
{
temp=sum[i];
l=i;
}
}
cout<<person[j].ID<<" "<<sum[j]<<endl;
cout<<person[k].ID<<" "<<sum[k]<<endl;
cout<<person[l].ID<<" "<<sum[l]<<endl;
return 0;
} | 14 |
6,762 | void main()
{
int n,i,y,s,z,x,a,b,c,ax,bx,cx;
scanf("%d",&n);a=0;b=0;c=0;ax=0;bx=0;cx=0;
for(i=1;i<=n;i++)
{
scanf("%d %d %d",&x,&y,&s);
z=y+s;
if(c>=z) continue;
else if(b>=z) {c=z; cx=x;}
else if(a>=z) {c=b;cx=bx; b=z; bx=x;}
else {c=b; cx=bx; b=a; bx=ax; a=z;ax=x;}
}
printf("%d %d\n",ax,a);
printf("%d %d\n",bx,b);
printf("%d %d\n",cx,c);
}
| 14 |
6,763 | struct data
{
int id;
int cs;
int ms;
int s;
};
int cmp(const void *a,const void *b)
{
return ((struct data*)b)->s - ((struct data*)a)->s;
}
main()
{
struct data *a;
int n;
int i;
scanf("%d",&n);
a=(struct data *)malloc(n*sizeof(struct data));
for (i=0;i<n;i++)
{
scanf("%d %d %d",&a[i].id,&a[i].cs,&a[i].ms);
a[i].s=a[i].cs+a[i].ms;
}
qsort(a,n,sizeof(struct data),cmp);
for (i=0;i<3;i++)
printf("%d %d\n",a[i].id,a[i].s);
free(a);
} | 14 |
6,764 | int main()
{
struct stu{
int ID,chin,math;
};
stu *pp;
int sum,second,third,x,y,z;
int i,n;
int a,b,c;
scanf("%d",&n);
pp=(struct stu *)malloc(sizeof(stu)*n);
for(i=1;i<=n;i++)
{
scanf("%d %d %d",&a,&b,&c);
(pp+i)->ID=a;
(pp+i)->chin=b;
(pp+i)->math=c;
}
sum = ((pp+i)->chin)+((pp+i)->math);
for(i=1;i<=n;i++)
{
if(i==1)
{
sum=((pp+i)->chin)+((pp+i)->math);
second=((pp+i)->chin)+((pp+i)->math);
third=((pp+i)->chin)+((pp+i)->math);
x=(pp+i)->ID;
y=(pp+i)->ID;
z=(pp+i)->ID ;
}
else if (i==2)
{
if (sum<((pp+i)->chin)+((pp+i)->math))
{
second=sum;
sum=((pp+i)->chin)+((pp+i)->math);
y=x;
x=(pp+i)->ID;
}
else
{
third=((pp+i)->chin)+((pp+i)->math);
z=(pp+i)->ID;
}
}
else
{
if (sum<((pp+i)->chin)+((pp+i)->math))
{
third=second;
second=sum;
sum=((pp+i)->chin)+((pp+i)->math);
z=y;
y=x;
x=(pp+i)->ID;
}
else if (second<((pp+i)->chin)+((pp+i)->math))
{
third=second;
second=((pp+i)->chin)+((pp+i)->math);
z=y;
y=(pp+i)->ID;
}
else if (third<((pp+i)->chin)+((pp+i)->math))
{
third=((pp+i)->chin)+((pp+i)->math);
z=(pp+i)->ID;
}
}
}
printf("%d %d\n",x,sum);
printf("%d %d\n",y,second);
printf("%d %d\n",z,third);
return 0;
} | 14 |
6,765 | int main()
{
struct student
{
int num;
int chinese;
int math;
int sum;
}stu[100000],t;
int n;
int i;
int k;
scanf("%d",&n);
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;
}
for(k=n-1;k>n-4;k--){
for(i=0;i<k;i++){
if(stu[i].sum>=stu[i+1].sum){
t=stu[i];
stu[i]=stu[i+1];
stu[i+1]=t;
}
}
}
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);
return 0;
}
| 14 |
6,766 | int main(int argc, char* argv[])
{
int x[100000];
int i,j,n,s,y,p;
int b[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&x[i],&y,&p);
b[i]=y+p;
}
int t;
for(i=0;i<3;i++)
{
for(j=i+1;j<n;j++)
{
if(b[j]>b[i])
{
s=x[i];
x[i]=x[j];
x[j]=s;
t=b[i];
b[i]=b[j];
b[j]=t;
}
}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",x[i],b[i]);
}
return 0;
}
| 14 |
6,767 |
int main(int argc, char* argv[])
{
int n,i,j,a,zf[100000];
struct student
{
int name;
int yw;
int sx;
}stu[100000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&stu[i].name,&stu[i].yw,&stu[i].sx);
zf[i]=stu[i].yw+stu[i].sx;
}
for(j=1;j<4;j++){
for(i=0;i<n-j;i++){
if(zf[i]>=zf[i+1]){
a=zf[i];
zf[i]=zf[i+1];
zf[i+1]=a;
a=stu[i].name;
stu[i].name=stu[i+1].name;
stu[i+1].name=a;
}
}
}
for(i=n-1;i>=n-3;i--){
printf("%d %d\n",stu[i].name,zf[i]);
}
return 0;
}
| 14 |
6,768 | void main()
{
int i,n,m;
scanf("%d\n",&n);
int j,b[100000]={0},t,s;
struct student
{
int num;
int lang;
int math;
};
struct student a[100000];
for(i=0;i<n;i++) scanf("%d %d %d\n",&a[i].num,&a[i].lang,&a[i].math);
for(i=0;i<n;i++) b[i]=a[i].lang+a[i].math;
for(j=0;j<3;j++)
for(i=1;i<n-j;i++)
if(b[j]<b[j+i])
{t=b[j];b[j]=b[j+i];b[j+i]=t;}
for(j=0;j<3;j++)
for(i=0;i<n;i++)
{
m=a[i].lang+a[i].math;
if(m==b[j] && i!=s) {printf("%d %d\n",a[i].num,m);s=i;break;}
}
}
| 14 |
6,769 | struct Student{//?????
int nID,nChinese,nMath;
};
void main(){
int n,i,a1,a2,a3,t1,t2,t3,t;//a1,a2,a3????????ID?t1,t2,t3????
struct Student students;
t1=0;
t2=0;
t3=0;
a1=0;
a2=0;
a3=0;
scanf("%d",&n);
for (i=1;i<=n;i++){
scanf("%d%d%d",&students.nID,&students.nChinese,&students.nMath);
t=students.nChinese+students.nMath;
if (t>t1){//????????????
t3=t2;
a3=a2; //???????????
t2=t1;
a2=a1; //???????????
t1=t;
a1=students.nID;
}else
if (t>t2){//?????????????????????
t3=t2;
a3=a2;//???????????
t2=t;
a2=students.nID;
}else
if (t>t3){
t3=t;
a3=students.nID;
}
}
printf("%d%s%d\n",a1," ",t1);
printf("%d%s%d\n",a2," ",t2);
printf("%d%s%d\n",a3," ",t3);
}
| 14 |
6,770 | struct
{
int xuehao;
int yuwen;
int shuxue;
}student[1000000];
void swap(int*a,int*b);
int main(int argc, char* argv[])
{
int n=0;
scanf("%d",&n);
int i=0,j=0,total[1000000];
for(i=0;i<n;i++)
{
scanf("%d%d%d",&student[i].xuehao,&student[i].yuwen,&student[i].shuxue);
total[i]=student[i].yuwen+student[i].shuxue;
}
for(i=0;i<3;i++)
{
for(j=n-1;j>0+i;j--)
{
if(total[j]>total[j-1])
{
swap(&total[j],&total[j-1]);
swap(&student[j-1].xuehao,&student[j].xuehao);
swap(&student[j-1].yuwen,&student[j].yuwen);
swap(&student[j-1].shuxue,&student[j].shuxue);
}
}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",student[i].xuehao,total[i]);
}
return 0;
}
void swap(int*a,int*b)
{
int e;
e=*a;
*a=*b;
*b=e;
} | 14 |
6,771 | struct Student {
int ID;
int chinese;
int maths;
int sum;
};
int main() {
struct Student stu[3],t; //????????
stu[0].sum =stu[1].sum =stu[2].sum =0; //???????0
int i, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> t.ID >> t.chinese >> t.maths;
t.sum = t.chinese + t.maths;
// ????????????
if(t.sum>stu[0].sum){
stu[2] = stu[1]; //????????????????
stu[1] = stu[0];
stu[0] = t;
} else if(t.sum>stu[1].sum){ //???????????
stu[2] = stu[1]; //???????????????
stu[1] = t;
} else if(t.sum>stu[2].sum){ //???????????
stu[2] = t; //??????????
}
}
//?????????????
for (i = 0; i < 3; i++) {
cout << stu[i].ID << " " << stu[i].sum << endl;
}
return 0;
}
| 14 |
6,772 | struct stu
{
int num;
int yuwen;
int shuxue;
int sum;
}score[100000];
int main()
{
int n,i,a,b,c,a1,b1,c1;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&score[i].num,&score[i].yuwen,&score[i].shuxue);
score[i].sum=score[i].shuxue+score[i].yuwen;
}a=0;
b=0;
c=0;
a1=0;
b1=0;
c1=0;
for(i=0;i<n;i++){
if(score[i].sum>a){
c=b;
b=a;
a=score[i].sum;
c1=b1;
b1=a1;
a1=score[i].num;
}else if(score[i].sum>b){
c=b;
b=score[i].sum;
c1=b1;
b1=score[i].num;
}else if(score[i].sum>c){
c=score[i].sum;
c1=score[i].num;
}
}printf("%d %d\n%d %d\n%d %d",a1,a,b1,b,c1,c);
return 0;
} | 14 |
6,773 | struct student
{
int a;
int b;
int c;
struct student *next;
};
void main()
{
int n=0,i,j,k;
scanf("%d",&k);
struct student *head,*p1,*p2;
p1=p2=(struct student *)malloc(L);
scanf("%d %d %d",&p1->a,&p1->b,&p1->c);
head=NULL;
for(i=0;i<k-1;i++)
{
n=n+1;
if(n==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(L);
scanf("%d %d %d",&p1->a,&p1->b,&p1->c);
}
p2->next=p1;
p2=p1;
p2->next=NULL;
struct student *g;
int x[100000],y[100000];
g=head;
for(i=0;i<k;i++)
{
x[i]=g->a;
y[i]=g->b+g->c;
g=g->next;
}
int m[4]={0},t,r=1,z=0;
m[0]=201;
for(i=0;i<3;i++)
{
for(j=0;j<k;j++)
{
if(m[r]<y[j]&&y[j]<m[r-1])
m[r]=y[j];
}
r++;
}
for(i=0;i<k;i++)
{
if(z==3)break;
if(y[i]==m[1])
{
printf("%d %d\n",x[i],y[i]);
z++;
}
}
for(i=0;i<k;i++)
{
if(z==3)break;
if(y[i]==m[2])
{
printf("%d %d\n",x[i],y[i]);
z++;
}
}
for(i=0;i<k;i++)
{
if(z==3)break;
if(y[i]==m[3])
{
printf("%d %d",x[i],y[i]);
z++;
}
}
} | 14 |
6,774 | struct student
{
int n;
int y;
int s;
};
int cmp(const void *a,const void *b)
{
return(((struct student *)b)->y > ((struct student *)a)->y?1:-1);
}
main()
{
int num;
scanf("%d",&num);
struct student s[100000];
for(int i=0;i<num;i++)
{
scanf("%d %d %d",&s[i].n,&s[i].y,&s[i].s);
s[i].y=s[i].y+s[i].s;
}
qsort(s,num,sizeof(s[0]),cmp);
for(int i=0;i<3;i++)
printf("%d %d\n",s[i].n,s[i].y);
} | 14 |
6,775 | // ????STUDENT_NUM????????????????
//?????????ID???????????????????
//???????????????????????
int n;
struct student
{
int num;
int chn;
int math;
int ovr;
struct student *next;
};
struct student *creat()
{
int i;
struct student *head;
struct student *p1,*p2;
head=(struct student *)malloc(sizeof(struct student));
p1=p2=head;
for(i=0;i<n;i++)
{
p2=p1;
p1=(struct student *)malloc(sizeof(struct student));
p2->next=p1;
scanf("%d %d %d",&p2->num,&p2->chn,&p2->math);
p2->ovr=p2->chn+p2->math;
}
p2->next=0;
return (head);
}
int main()
{
int i;
int no1,ovr1=0;
struct student *head;
struct student *p1,*p2;
scanf("%d",&n);
head=creat();
p1=p2=head;
for(i=0;i<3;i++)
{
p1=head;
while(p1->next!=0)
{
if(p1->ovr>ovr1)
{
ovr1=p1->ovr;
no1=p1->num;
p2=p1;
}
p1=p1->next;
}
printf("%d %d\n",no1,ovr1);
p2->ovr=0;
ovr1=0;
}
return 0;
}
| 14 |
6,776 |
struct data
{
int num[100000],a[100000],b[100000],sum[100000];
}data;
int main(int argc, char* argv[])
{
int i,n,x=0,y=0,z=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&data.num[i],&data.a[i],&data.b[i]);
data.sum[i]=data.a[i]+data.b[i];
}
for(i=0;i<n;i++)
{
if(data.sum[i]>data.sum[x])
{
z=y;
y=x;
x=i;
continue;
}
if(data.sum[i]<=data.sum[x]&&data.sum[i]>data.sum[y])
{
z=y;
y=i;
continue;
}
if(data.sum[i]<=data.sum[y]&&data.sum[i]>data.sum[z])
z=i;
}
printf("%d %d\n",data.num[x],data.sum[x]);
printf("%d %d\n",data.num[y],data.sum[y]);
printf("%d %d",data.num[z],data.sum[z]);
} | 14 |
6,777 | struct student
{int nn;
int nnn;
int nmn;
int sum;
}st[100002],tmp;
int main()
{int i,j,m,n;
scanf("%d",&n);
for(i=1;i<=n;i++)
{scanf("%d %d %d",&st[i].nn,&st[i].nnn,&st[i].nmn);
st[i].sum=st[i].nnn+st[i].nmn;
}
for(i=1;i<=3;i++)
{for(j=i+1;j<=n;j++)
{if(st[i].sum<st[j].sum)
{tmp=st[i];
st[i]=st[j];
st[j]=tmp;
}
}
}
for(i=1;i<=3;i++)
{printf("%d %d",st[i].nn,st[i].sum);
if(i<3)
printf("\n");
}
return 0;
} | 14 |
6,778 | int main()
{
long n,i,j,math[100000],chin[100000],total[100000],id[100000];
scanf("%ld",&n);
for(i=0;i<n;i++)
{scanf("%ld",&id[i]);
scanf("%ld",&math[i]);
scanf("%ld",&chin[i]);}
for(i=0;i<n;i++)
{total[i]=100000*(math[i]+chin[i])+100000-id[i];}
int comp(const void *a,const void *b);
qsort(total,n,sizeof(long ),comp);
printf("%ld %ld\n",100000-(total[n-1]-100000*((int)total[n-1]/100000)),(int)total[n-1]/100000);
printf("%ld %ld\n",100000-(total[n-2]-100000*((int)total[n-2]/100000)),(int)total[n-2]/100000);
printf("%ld %ld\n",100000-(total[n-3]-100000*((int)total[n-3]/100000)),(int)total[n-3]/100000);
getchar();
getchar();
}
int comp(const void *a,const void *b)
{
return *(long *)a-*(long *)b;
}
| 14 |
6,779 | struct student
{
int id;
int chinese;
int math;
int total;
};
int main()
{
struct student stu[100000];
struct student max[3]={0,0,0,0,0,0,0,0,0,0,0,0};
int n,i;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d %d %d\n",&stu[i].id,&stu[i].chinese,&stu[i].math);
stu[i].total = stu[i].chinese + stu[i].math;
}
for (i=0;i<n;i++)
{
if (stu[i].total > max[1].total)
{
max[1]=stu[i];
}
}
for (i=0;i<n;i++)
{
if (stu[i].total > max[2].total && stu[i].total <= max[1].total && stu[i].id!=max[1].id)
{
max[2]=stu[i];
}
}
for (i=0;i<n;i++)
{
if (stu[i].total > max[3].total && stu[i].total <= max[2].total && stu[i].id!=max[2].id && stu[i].id!=max[1].id)
{
max[3]=stu[i];
}
}
for (i=1;i<4;i++)
{
printf("%d %d\n",max[i].id,max[i].total);
}
return 0;
} | 14 |
6,780 | int main()
{
int n,i,b,c,d;
struct{
int sn;
int chi;
int mat;
int sum;
}a[100000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&a[i].sn,&a[i].chi,&a[i].mat);
a[i].sum=a[i].chi+a[i].mat;
}
b=n;
c=n;
d=n;
a[n].sum=-100;
for(i=0;i<n;i++){
if(a[b].sum>=a[i].sum)b=b;
else b=i;
}
for(i=0;i<n;i++){
if(i!=b){if(a[c].sum>=a[i].sum)c=c;else c=i;}
else ;
}
for(i=0;i<n;i++){
if(i!=c&i!=b){if(a[d].sum>=a[i].sum)d=d;else d=i;}
else ;
}
printf("%d %d\n",a[b].sn,a[b].sum);
printf("%d %d\n",a[c].sn,a[c].sum);
printf("%d %d\n",a[d].sn,a[d].sum);
return 0;
} | 14 |
6,781 | struct data
{
long int num;
int point1;
int point2;
int sum;
struct data*next;
};
struct data*creat(long int n)
{
long int i=0;
struct data*p1,*p2,*head;
p1=p2=(struct data*)malloc(sizeof(struct data));
scanf("%ld %d %d",&p1->num,&p1->point1,&p1->point2);
p1->sum=p1->point1+p1->point2;
head=NULL;
while(i<n)
{
i=i+1;
if(i==1) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct data*)malloc(sizeof(struct data));
scanf("%ld %d %d",&p1->num,&p1->point1,&p1->point2);
p1->sum=p1->point1+p1->point2;
}
p2->next=NULL;
return(head);
}
struct data*max(struct data*head)
{
struct data *p1,*max;
max=head;
p1=head;
do
{
if(p1->sum>max->sum) max=p1;
p1=p1->next;
}while(p1!=NULL);
return(max);
}
struct data*del(struct data*head,struct data*max)
{
struct data *p1,*p2;
p1=head;
while(max!=p1)
{
p2=p1;
p1=p1->next;
}
if(p1==head)
head=p1->next;
else
{
p2->next=p1->next;
}
return(head);
}
void main()
{
struct data*a,*b,*c,*head;
long int n;
scanf("%ld",&n);
head=creat(n);
a=max(head);
printf("%ld %d\n",a->num,a->sum);
head=del(head,a);
b=max(head);
printf("%ld %d\n",b->num,b->sum);
c=max(del(head,b));
printf("%ld %d\n",c->num,c->sum);
} | 14 |
6,782 | int main()
{
int n,i,num[100000],j,grade1[100000],grade2[100000],grade[100000],t1,t2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&num[i],&grade1[i],&grade2[i]);
grade[i]=grade1[i]+grade2[i];
}
for(j=1;j<4;j++)
{
for(i=0;i<n-j;i++)
{
if(grade[i]>=grade[i+1])
{
t1=grade[i];
grade[i]=grade[i+1];
grade[i+1]=t1;
t2=num[i];
num[i]=num[i+1];
num[i+1]=t2;
}
}
}
printf("%d %d\n%d %d\n%d %d",num[n-1],grade[n-1],num[n-2],grade[n-2],num[n-3],grade[n-3]);
} | 14 |
6,783 |
int main()
{
struct student{
long num;
long chinese;
long maths;
long sum;
}t[100000],l;
long n,i,j,k,tmp;
scanf("%ld",&n);
for(i=0;i<n;i++)
{
scanf("%ld %ld %ld",&t[i].num,&t[i].chinese,&t[i].maths);
}
for(i=0;i<n;i++)
{
t[i].sum=t[i].chinese+t[i].maths;
}
for(i=0;i<3;i++)
{
k=i;
for(j=i+1;j<n;j++)
{
if(t[j].sum>t[k].sum)
k=j;
}
l=t[k];
t[k]=t[i];
t[i]=l;
}
for(i=0;i<3;i++)
{
printf("%ld %ld\n",t[i].num,t[i].sum);
}
return 0;
} | 14 |
6,784 | int main()
{
struct student
{
int num;
int chinese;
int math;
int sum;
}stu[100001],t;
int n,i,j;
scanf("%d",&n);
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;
}
for(i=0;i<3;i++)
{
for(j=0;j<n-1-i;j++)
{
if(stu[j].sum>=stu[j+1].sum)
{
t=stu[j];
stu[j]=stu[j+1];
stu[j+1]=t;
}
}
}
for(i=n-1;i>n-4;i--)
{
printf("%d %d\n",stu[i].num,stu[i].sum);
}
return 0;
} | 14 |
6,785 | struct stu
{
int a;
int b;
int c;
int d;
};
void main()
{
int i,j,n,t;
struct stu *p1,p2;
scanf("%d",&n);
p1=(struct stu*)calloc(n,sizeof(struct stu));
for(i=0;i<n;i++)
{
scanf("%d %d %d",&(p1[i].a),&(p1[i].b),&(p1[i].c));
p1[i].d=p1[i].b+p1[i].c;
}
for(i=0;i<3;i++)
for(j=i+1;j<n;j++)
if(p1[i].d<p1[j].d)
{
p2=p1[i];
p1[i]=p1[j];
p1[j]=p2;
}
for(i=0;i<3;i++)
printf("%d %d\n",p1[i].a,p1[i].d);
}
| 14 |
6,786 | int n;
struct student
{
int num;
int chinese;
int math;
int total;
struct student *next;
};
struct student *creat(int n)
{
struct student *head;
struct student *p1,*p2;
int i;
if(n==0)
{
head=NULL;
return(head);
}
else
{
p1=(struct student*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->chinese,&p1->math);
p1->next=NULL;
head=p1;
p2=p1;
for(i=1;i<n;i++)
{
p1=(struct student*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->chinese,&p1->math);
p1->next=NULL;
p2->next=p1;
p2=p1;
}
return(head);
}
}
void top3(struct student *head)
{
struct student *p,*p1;
int max=0;
p=head;
do
{
p->total=(p->chinese)+(p->math);
if((p->total)>max)
{
max=p->total;
p1=p;
}
p=p->next;
}while(p!=NULL);
printf("%d %d\n",p1->num,p1->total);
p1->total=0;
p=head;
max=0;
do
{
if((p->total)>max)
{
max=p->total;
p1=p;
}
p=p->next;
}while(p!=NULL);
printf("%d %d\n",p1->num,p1->total);
p1->total=0;
p=head;
max=0;
do
{
if((p->total)>max)
{
max=p->total;
p1=p;
}
p=p->next;
}while(p!=NULL);
printf("%d %d\n",p1->num,p1->total);
p1->total=0;
max=0;
}
void main()
{
struct student *head;
scanf("%d",&n);
head=creat(n);
top3(head);
} | 14 |
6,787 | int main()
{
struct{
int n;
int a;
int b;
}n[100000];
int m,i,sum[100000],first,second,third,d,e,f;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&n[i].n);
scanf("%d",&n[i].a);
scanf("%d",&n[i].b);
sum[i]=n[i].a+n[i].b;
}
if(sum[0]>sum[1]&&sum[0]>sum[2]&&sum[1]>sum[2])
{
first=sum[0];
second=sum[1];
third=sum[2];
d=1;
e=2;
f=3;
}
else if (sum[0]>sum[1]&&sum[1]<sum[2]&&sum[0]>sum[2])
{
first=sum[0];
second=sum[2];
third=sum[1];
d=1;
e=3;
f=2;
}
else if (sum[0]<sum[1]&&sum[1]>sum[2]&&sum[0]>sum[2])
{
first=sum[1];
second=sum[0];
third=sum[2];
d=2;
e=1;
f=3;
}
else if (sum[0]<sum[1]&&sum[1]>sum[2]&&sum[0]<sum[2])
{
first=sum[1];
second=sum[2];
third=sum[0];
d=2;
e=3;
f=1;
}
else if (sum[0]<sum[1]&&sum[1]<sum[2]&&sum[0]<sum[2])
{
first=sum[2];
second=sum[1];
third=sum[0];
d=3;
e=2;
f=1;
}
else if (sum[0]>sum[1]&&sum[1]<sum[2]&&sum[0]<sum[2])
{
first=sum[2];
second=sum[0];
third=sum[1];
d=3;
e=1;
f=2;
}
for(i=3;i<m;i++)
{
if(sum[i]>first)
{
third=second;
second=first;
first=sum[i];
f=e;
e=d;
d=i+1;
}
else if (sum[i]<=first&&sum[i]>second)
{
third=second;
second=sum[i];
f=e;
e=i+1;
}
else if (sum[i]<=second&&sum[i]>third)
{
third=sum[i];
f=i+1;
}
}
printf("%d %d\n",d,first);
printf("%d %d\n",e,second);
printf("%d %d\n",f,third);
return 0;
} | 14 |
6,788 |
struct Student
{
int num;
int Chi;
int Math;
int sum;
};
struct Student stud[100000],temp;
int main()
{
int n,i,j;
cin>>n;
for(i=0;i<n;i++)
{
cin>>stud[i].num>>stud[i].Chi>>stud[i].Math;
stud[i].sum=stud[i].Chi+stud[i].Math;
}
if(n==2)
{
if(stud[0].sum<stud[1].sum)
{
temp=stud[0];
stud[0]=stud[1];
stud[1]=temp;
}
}
else
{
for(i=0;i<3;i++)
{
for(j=n-1;j>i;j--)
{
if(stud[j].sum>stud[j-1].sum)
{
temp=stud[j];
stud[j]=stud[j-1];
stud[j-1]=temp;
}
}
}
}
if(n==2)
{
cout<<stud[0].num<<' '<<stud[0].sum<<endl;
cout<<stud[1].num<<' '<<stud[1].sum;
}
for(i=0;i<2;i++)
{
cout<<stud[i].num<<' '<<stud[i].sum<<endl;
}
cout<<stud[2].num<<' '<<stud[2].sum;
return 0;
}
| 14 |
6,789 | struct Student
{ int num;
int ch;
int math;
int sum;
};
int main()
{
struct Student stu[4],temp;
int i,j,k,n;
scanf("%d",&n);
for(i=0;i<3;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].ch,&stu[i].math);
stu[i].sum=stu[i].ch+stu[i].math;
}
for(i=0;i<2;i++)
{
k=i;
for(j=i+1;j<3;j++)
if(stu[j].sum>stu[i].sum)
{k=j;
temp=stu[k];
stu[j]=stu[i];
stu[i]=temp;}
}
// for(i=0;i<3;i++)
// printf("%d %d\n",stu[i].num,stu[i].sum);
for(i=3;i<n;i++)
{
scanf("%d %d %d",&stu[3].num,&stu[3].ch,&stu[3].math);
stu[3].sum=stu[3].ch+stu[3].math;
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,790 | int main()
{
struct student
{
char ID[10];
int m;
int c;
}tmp;
int max1=0,max2=0,max3=0;
int a1=0,a2=0,a3=0;
int n,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d",tmp.ID,&(tmp.m),&(tmp.c));
if((tmp.m+tmp.c)>max1)
{
max3=max2;
max2=max1;
max1=tmp.m+tmp.c;
a3=a2;
a2=a1;
a1=i;
}
else if((tmp.m+tmp.c)==max1)
{
max3=max2;
max2=max1;
max1=tmp.m+tmp.c;
a3=a2;
a2=i;
}
else if((tmp.m+tmp.c)<max1 && (tmp.m+tmp.c)>max2)
{
max3=max2;
max2=tmp.m+tmp.c;
a3=a2;
a2=i;
}
else if((tmp.m+tmp.c)==max2)
{
max3=max2;
a3=atoi(tmp.ID);
}
else if((tmp.m+tmp.c)<max2 && (tmp.m+tmp.c)>max3)
{
max3=tmp.m+tmp.c;
a3=i;
}
}
printf("%d %d\n",a1,max1);
printf("%d %d\n",a2,max2);
printf("%d %d\n",a3,max3);
return 0;
}
| 14 |
6,791 | struct student
{
int id;
int math_grade;
int chi_grade;
int sum;
}stu[100000];
void main()
{
int i,j,n,max,temp1,temp2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&stu[i].id);
scanf("%d",&stu[i].math_grade);
scanf("%d",&stu[i].chi_grade);
}
for(i=0;i<n;i++)
stu[i].sum=stu[i].math_grade+stu[i].chi_grade;
for(i=0;i<3;i++)
{
max=stu[i].sum;
for(j=i+1;j<n;j++)
{
if(stu[j].sum>max)
{
temp1=stu[i].id;
stu[i].id=stu[j].id;
stu[j].id=temp1;
temp2=stu[i].sum;
stu[i].sum=stu[j].sum;
stu[j].sum=temp2;
max=stu[i].sum;
}
}
}
for(i=0;i<2;i++)
printf("%d %d\n",stu[i].id,stu[i].sum);
printf("%d %d",stu[2].id,stu[2].sum);
} | 14 |
6,792 | struct student
{int num;
int yw;
int sx;
struct student *next;
};
void main()
{
struct student *head,*p1,*p2;
int i,max,n;
scanf("%d",&n);
p1=p2=head=NULL;
for(i=0;i<n;i++)
{p1=(struct student*)malloc(LEN);
scanf("%d%d%d",&p1->num,&p1->yw,&p1->sx);
if(i==0)head=p1;
else p2->next=p1;
p2=p1;
}
p2->next=NULL;
for(i=0;i<3;i++)
{p1=p2=head;
max=p1->yw+p1->sx;
while(p1!=NULL)
{if((p1->yw+p1->sx)>max)
{max=p1->yw+p1->sx;
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,793 | struct student
{
long num;
int math;
int chinese;
struct student *next;
};
long stu_num;
struct student *max1,*max2,*max3;
struct student *creat(void)
{
struct student *head,*p1,*p2;
long n;
p1=p2=(struct student *)malloc(LEN);
scanf("%ld%d%d",&p1->num,&p1->math,&p1->chinese);
head=NULL;
n=0;
while(n<stu_num)
{
n++;
if(n==1)
head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%ld%d%d",&p1->num,&p1->math,&p1->chinese);
}
p2->next=NULL;
return(head);
}
void Max1(struct student *head,long stu_num)
{
struct student *q1;
q1=head;
max1=head;
for(;q1!=NULL;)
if((max1->math+max1->chinese)<(q1->math+q1->chinese))
{
max1=q1;
q1=q1->next;
}
else
q1=q1->next;
printf("%ld %d\n",max1->num,max1->math+max1->chinese);
}
void Max2(struct student *head,long stu_num)
{
struct student *q2;
q2=head;
if(head!=max1)
max2=head;
else
max2=q2->next;
for(;q2!=NULL;)
if((max2->math+max2->chinese)<(q2->math+q2->chinese)&&q2!=max1)
{
max2=q2;
q2=q2->next;
}
else
q2=q2->next;
printf("%ld %d\n",max2->num,max2->math+max2->chinese);
}
void Max3(struct student *head,long stu_num)
{
struct student *q3;
q3=head;
for(;q3!=NULL;)
if(q3==max1||q3==max2)
q3=q3->next;
else
{
max3=q3;
break;
}
q3=head;
for(;q3!=NULL;)
if((max3->math+max3->chinese)<(q3->math+q3->chinese)&&q3!=max1&&q3!=max2)
{
max3=q3;
q3=q3->next;
}
else
q3=q3->next;
printf("%ld %d\n",max3->num,max3->math+max3->chinese);
}
void main()
{
struct student *head;
scanf("%ld",&stu_num);
head=creat();
Max1(head,stu_num);
Max2(head,stu_num);
Max3(head,stu_num);
}
| 14 |
6,794 | struct result//??result?????num?????????????
{ int num;
int chn;
int math;
int total;
};
int main()
{int n,k;
cin>>n;
struct result student[n+1];//?result??????student
for(k=1;k<=n;k++)
{cin>>student[k].num>>student[k].chn>>student[k].math;//??????
student[k].total=student[k].chn+student[k].math;//?????
}
int i,j;
struct result temp;
for(i=1;i<4;i++)
for(j=1;j<=n-i;j++)//???????
{if(student[j].total>=student[j+1].total)
{temp=student[j];
student[j]=student[j+1];
student[j+1]=temp;
}
}
cout<<student[n].num<<" "<<student[n].total<<endl;
cout<<student[n-1].num<<" "<<student[n-1].total<<endl;
cout<<student[n-2].num<<" "<<student[n-2].total<<endl;
return 0;
} | 14 |
6,795 | struct student
{
int num;
int chi;
int math;
int sum;
struct student *next;
};
int n,k;
void main()
{int i,j;
scanf("%d",&n);
int m;
m=0;
struct student *head;
struct student *p1,*p2;
p1=p2=(struct student *)malloc(len);
scanf("%d %d %d",&p1->num,&p1->chi,&p1->math);
p1->sum=p1->chi+p1->math;
head=p1;
while(m<n-1)
{m=m+1;
p1=(struct student *)malloc(len);
scanf("%d %d %d",&p1->num,&p1->chi,&p1->math);
p1->sum=p1->chi+p1->math;
p2->next=p1;
p2=p1;
}
p2->next=0;
struct student *max,*p;
for(i=0;i<3;i++)
{ max=head;
p=p2=head;
p1=p2;
for(j=0;j<n-i;j++)
{ if(p1->sum>max->sum)
{max=p1;
p=p2;}
p2=p1;
p1=p2->next;}
p1=p2=head;
printf("%d %d\n",max->num,max->sum);
if(max->num==head->num)
head=p1->next;
else p->next=max->next;
}
}
| 14 |
6,796 | struct stu
{long num;
int y;
int s;
int t;
struct stu * next;
};
void main()
{
struct stu * head,*p1,*p2;
int n,i;
scanf("%d",&n);
p1=p2=(struct stu *)malloc(L);
scanf("%ld %d %d",&p1->num,&p1->y,&p1->s);
head=p1;
for(i=1;i<n;i++)
{
p1=(struct stu*) malloc(L);
scanf("%ld %d %d",&p1->num,&p1->y,&p1->s);
p1->t=p1->y+p1->s;
p2->next=p1;
p2=p1;
}
p2->next=0;
int k=0;
while(k<3)
{
p2=head;
for(;p2!=0;p2=p2->next)
{
for(p1=p2->next;p1!=0;)
{
if(p2->t<p1->t) break;
else p1=p1->next;
}
if(p1==0) {printf("%ld %d\n",p2->num,p2->t);break;}
}
k=k+1;p2->t=0;
}
} | 14 |
6,797 | main()
{
int i,j,k,m=0,n,e,f,g,h;
int *a,*b,*c;
scanf("%d",&n);
a=(int*)malloc(n*sizeof(int));
b=(int*)malloc(n*sizeof(int));
c=(int*)malloc(n*sizeof(int));
for(i=0;i<n;i++)
scanf("%d %d %d",&a[i],&b[i],&c[i]);
for(i=0;i<n;i++)
a[i]=b[i]+c[i];
for(i=0;i<n;i++)
b[i]=a[i];
for(i=0;i<n;i++)
{
if(a[i]>m)
m=a[i];
}
for(i=0;i<n;i++)
{
if(b[i]==m)
break;
}
printf("%d %d\n",i+1,m);
b[i]=0;
a[i]=0;
m=0;
for(i=0;i<n;i++)
{
if(b[i]>m)
m=b[i];
}
for(i=0;i<n;i++)
{
if(a[i]==m)
break;
}
printf("%d %d\n",i+1,m);
a[i]=0;
b[i]=0;
m=0;
for(i=0;i<n;i++)
{
if(b[i]>m)
m=b[i];
}
for(i=0;i<n;i++)
{
if(a[i]==m)
break;
}
printf("%d %d\n",i+1,m);
free(a);
a=0;
free(b);
b=0;
free(c);
c=0;
}
| 14 |
6,798 | int main(){
int n;
cin>>n;
struct stu{
int num;
int chin;
int math;
int sum;
}one[n+1];
for(int i=1;i<=n;i++){
cin>>one[i].num>>one[i].chin>>one[i].math;
one[i].sum=one[i].chin+one[i].math;
} //???????
int t=0;
for(int i=200;i>=0;i--)
for(int j=1;j<=n;j++){
if (one[j].sum==i) {
cout<<j<<" "<<one[j].sum<<endl;
t=t+1;
}
if (t==3) {
i=-1;break;
}
}//????????
return 0;
} | 14 |
6,799 |
struct student//?????
{
int NO;
int chinese;
int math;
};
int main()
{
struct student a[100001];
int n,i,j;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i].NO>>a[i].chinese>>a[i].math;//??
for(i=1;i<=3;i++)
for(j=n-1;j>=i;j--)
if(a[j].chinese+a[j].math<a[j+1].chinese+a[j+1].math)//??????????
{
a[0]=a[j];
a[j]=a[j+1];
a[j+1]=a[0];
}
for(i=1;i<=3;i++)
cout<<a[i].NO<<' '<<a[i].chinese+a[i].math<<endl;//??
}
| 14 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.