label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
14 | 6500 | 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 | 6501 |
struct stu
{
int num;
int mark1;
int mark2;
long int total_mark;
};
int main(void)
{
int n,i,j,k,t=0,max;
struct stu *p;
struct stu *q;
scanf("%d",&n);
p=(struct stu *)malloc(1000000*sizeof(struct stu));
q=p;
for(i=0;i<n;i++)
{
scanf("%d %d %d",&(p+i)->num,&(p+i)->mark1,&(p+i)->mark2);
(p+i)->total_mark=(p+i)->mark1+(p+i)->mark2;
}
loop: max=0;
for(j=0;j<n;j++)
{
if((p+j)->total_mark>max)
max=(p+j)->total_mark;
}
for(k=0;k<n;k++)
if(max==(p+k)->total_mark&&k<n)
{
printf("%d %ld\n",(p+k)->num,(p+k)->total_mark);
t++;
(p+k)->total_mark=0;
break;
}
if(t<3) goto loop;
} |
14 | 6502 | 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 | 6503 | 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 | 6504 | 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 | 6505 | struct student{ int num;int a;int b;int c;};
void main()
{
int n,i,j,m,t;
struct student stu[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d %d %d",&stu[i].num,&stu[i].a,&stu[i].b);
stu[i].c=stu[i].a+stu[i].b;}
for(i=0;i<3;i++)
for(j=i+1;j<n;j++)
{
if(stu[i].c<stu[j].c){
t=stu[i].c;stu[i].c=stu[j].c;stu[j].c=t;
m=stu[i].num;stu[i].num=stu[j].num;stu[j].num=m;}
}
for(i=0;i<3;i++)
printf("%d %d\n",stu[i].num,stu[i].c);
} |
14 | 6506 | int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
struct stu{
int id;
int x,y;
}stu[100000];
int no1=0;
int no2=0;
int no3=0;
int i;
int N1,N2,N3;
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[i].id,&stu[i].x,&stu[i].y);
}
for(i=0;i<n;i++)
{
if((stu[i].x+stu[i].y)>no1){no2=no1;no1=(stu[i].x+stu[i].y);N2=N1;N1=i;}
else if((stu[i].x+stu[i].y)>no2){no3=no2;no2=(stu[i].x+stu[i].y);N3=N2;N2=i;}
else if((stu[i].x+stu[i].y)>no3){no3=(stu[i].x+stu[i].y);N3=i;}
}
printf("%d %d\n%d %d\n%d %d",stu[N1].id,(stu[N1].x+stu[N1].y),stu[N2].id,(stu[N2].x+stu[N2].y),stu[N3].id,(stu[N3].x+stu[N3].y));
return 0;
}
|
14 | 6507 |
struct student
{long num;
int math;
int chinese;
int sum;
struct student *next;
};
long n;
struct student *creat(void)
{struct student *head;
struct student *p1,*p2;
int i=1;
scanf("%ld",&n);
p1=p2=(struct student*)malloc(LEN);
scanf("%ld%d%d",&p1->num,&p1->math,&p1->chinese);
p2->sum=p2->chinese+p2->math;
while (i<=n)
{
if(i==1) head=p1;
else
{p1=(struct student*)malloc(LEN);
scanf("%ld%d%d",&p1->num,&p1->math,&p1->chinese);
p1->sum=p1->chinese+p1->math;
p2->next=p1;
p2=p1;}
i++;
}
p2->next=0;
return head;
}
struct student *del(struct student *head,int max)
{
struct student *p1,*p2;
p1=head;
while (p1->sum!=max&&p1->next!=0)
{
p2=p1;p1=p1->next;
}
if(p1->sum==max)
{
if(p1==head) head=p1->next;
else p2->next=p1->next;
n=n-1;
}
return(head);
}
void print(struct student *head)
{
struct student *p1,*p2;
int i,max,num;
max=head->sum;
p1=head;
p2=p1->next;
for(i=1;i<=3;i++)
{
while(p1->next!=0)
{
if((p2->sum)>max) {max=p2->sum; num=p2->num;}
p1=p2;
p2=p1->next;
}
printf("%ld %d\n",num,max);
head=del(head,max);
p1=head;
p2=p1->next;
max=p1->sum;
}
}
//void print (struct student*head)
//{
// struct student *p;
// p=head;
// if(head!=0)
// do
// {
// printf("%ld %d %d %d\n",p->num,p->math,p->chinese,p->sum);
// p=p->next;
// }while (p!=0);
//}
main()
{
struct student *head;
head=creat();
print(head);
} |
14 | 6508 | void main()
{
struct stu
{
int num;
int chinese;
int math;
int sum;
struct stu*next;
};
int n,max,i;
struct stu *p1,*p2,*head,*maxsum;
scanf("%d",&n);
p1=p2=(struct stu*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->chinese,&p1->math);
for(i=1;i<n;i++)
{
if(i==1)
head=p1;
else p2->next=p1;
p2=p1;
p1=(struct stu*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->chinese,&p1->math);
}
p2->next=p1;
p2=p1;
p2->next=NULL;
p1=head;
while(p1->next!=NULL)
{
p1->sum=p1->chinese+p1->math;
p1=p1->next;
}
p1->sum=p1->chinese+p1->math;
for(i=1;i<=3;i++)
{
p1=head;
max=p1->sum;
maxsum=p1;
while(p1->next!=NULL)
{
if(p1->sum>max)
{
maxsum=p1;
max=p1->sum;
}
p1=p1->next;
}
if(p1->sum>max)
{
maxsum=p1;
max=p1->sum;
}
printf("%d %d\n",maxsum->num,maxsum->sum);
maxsum->sum=0;
}
}
|
14 | 6509 | struct stu{
int ID;
int ch;
int ma;
int sum;
struct stu *next;
};
int main(){
struct stu *head;
struct stu *p1,*p2,*a,*b,*c,*t;
int n,i=0;
a=b=c=p1=p2=(struct stu *) malloc(sizeof(struct stu));
scanf("%d",&n);
scanf("%d%d%d",&p1->ID,&p1->ch,&p1->ma);
p1->sum=p1->ch+p1->ma;
head=NULL;
while(i<n-1){
i++;
p1->sum=p1->ch+p1->ma;
if(i==1)head=p1;
else p2->next=p1;
p2=p1;
if(p1->sum>a->sum) {c=b;b=a;a=p2;}
else if(p1->sum>b->sum) {c=b;b=p2;}
else if(p1->sum>c->sum) c=p2;
p1=(struct stu *) malloc(sizeof(struct stu));
scanf("%d%d%d",&p1->ID,&p1->ch,&p1->ma);
}
p2->next=NULL;
printf("%d %d\n%d %d\n%d %d\n",a->ID,a->sum,b->ID,b->sum,c->ID,c->sum);
return 0;
}
|
14 | 6510 | //#define NULL 0
struct student
{
int num;
int ch;
int math;
int sum;
struct student*next;
};
struct student *creat(int n)
{
struct student *head;
struct student *p1,*p2;
int i;
p1=p2=(struct student *)malloc(sizeof (struct student));
scanf("%d %d %d",&p1->num,&p1->ch,&p1->math);
//head=NULL;
for(i=0;i<n-1;i++)
{
if(i==0)head=p1;
p1=(struct student*)malloc(sizeof(struct student));
scanf("%d %d %d",&p1->num,&p1->ch,&p1->math);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return (head);
}
void print(struct student*head)
{
struct student*p;
p=head;
if(head!=NULL)
do
{
printf("%d %d %d",p->num,p->ch,p->math);
p=p->next;
}while(p!=NULL);
}
main()
{
int n,i,j,k,t;
struct student *p1,*p2,*p3,*p;
struct student g;
scanf("%d",&n);
p=creat(n);p1=p;
p2=p;p3=p;
for(i=0;i<n;i++)
{
p1->sum=p1->math+p1->ch;
//printf("%d\n",p1->sum);
p1=p1->next;
}
p1=p;p2=p;printf("\n\n");
i=0;
while(i<3)
{
p1=p2->next;
while(p1!=NULL)
{
if((p2->sum)<(p1->sum))
{
g.num=p2->num;
p2->num=p1->num;
p1->num=g.num;
g.sum=p2->sum;
p2->sum=p1->sum;
p1->sum=g.sum;
}
p1=p1->next;
}
p2=p2->next;i=i+1;
}
p1=p;p2=p;
//printf("\n\n");
/*for(i=0;i<n;i++)
{
printf("%d\n",p1->sum);
p1=p1->next;
}*/
p1=p;
for(i=0;i<3;i++)
{
printf("%d %d\n",p1->num,p1->sum);
p1=p1->next;
}
}
|
14 | 6511 | /*
* jiegou_1.cpp
*
* Created on: 2011-1-2
* Author: Iris
* ????????
* ????STUDENT_NUM???????????????? ?????????ID???????????
* ???????????????????????????????
*/
int main(){
int n,i;
cin>>n;//??????
struct student{
int stuNo;
int yuwen;
int shuxue;
int zongfen;
} stu[n];//?????????????????????????t?????
struct tri{
int stuNo;
int zongfen;
} qian[3]={0,0,0,0,0,0};//??????????????????????
for(i=0;i<n;i++){
cin>>stu[i].stuNo;
cin>>stu[i].yuwen;
cin>>stu[i].shuxue;//????????????
stu[i].zongfen=stu[i].yuwen+stu[i].shuxue;//?????????
}
for(i=0;i<n;i++){
if(stu[i].zongfen>qian[0].zongfen){
qian[2]=qian[1];
qian[1]=qian[0];
qian[0].stuNo=stu[i].stuNo;
qian[0].zongfen=stu[i].zongfen;
continue;
}
if(stu[i].zongfen>qian[1].zongfen){
qian[2]=qian[1];
qian[1].stuNo=stu[i].stuNo;
qian[1].zongfen=stu[i].zongfen;
continue;
}
if(stu[i].zongfen>qian[2].zongfen){
qian[2].stuNo=stu[i].stuNo;
qian[2].zongfen=stu[i].zongfen;
}
}//?????
for(i=0;i<3;i++)
cout<<qian[i].stuNo<<' '<<qian[i].zongfen<<endl;//????????????
return 0;
}
|
14 | 6512 | struct student
{
int num;
int c;
int m;
int sum;
struct student *next;
};
void main()
{
int n,i,j;
scanf("%d",&n);
struct student *head,*p0,*p,*q;
head=(struct student*)malloc(sizeof(struct student));
head->next=NULL;
for(i=0;i<n;i++)
{
q=(struct student*)malloc(sizeof(struct student));
scanf("%d %d %d",&q->num,&q->c,&q->m);
q->sum=q->c+q->m;
q->next=NULL;
p0=head;
p=p0->next;
j=0;
while(p!=NULL&&q->sum<=p->sum)
{
p0=p;
p=p->next;
j++;
if(j>3)
goto A;
}
p0->next=q;
q->next=p;
A: continue;
}
p=head->next;
for(i=0;i<3;i++)
{
printf("%d %d\n",p->num,p->sum);
p=p->next;
}
} |
14 | 6513 | /*
* mark.cpp
*
* Created on: 2011-12-9
* Author: admin
*/
struct student{
int id;
int chi;
int math;
};
struct maxer{
int id;
int mark;
};
int main(){
int n,i,j;
struct student a[100001],temp;
struct maxer max,top[3]; //top3????
cin>>n;
for (i=1;i<=n;i++){
cin>>a[i].id>>a[i].chi>>a[i].math;
}
for (i=1;i<=3;i++){ //????
max.mark=0;
for (j=i;j<=n;j++){
if (a[j].chi+a[j].math>max.mark){
max.id=a[j].id;
max.mark=a[j].chi+a[j].math; //?????
}
}
top[i-1]=max; //????????????????????????
temp=a[i];
a[i]=a[max.id];
a[max.id]=temp;
}
for (i=0;i<=2;i++){
cout<<top[i].id<<' '<<top[i].mark;
if (i!=2)cout<<endl;
}
return 0;
}
|
14 | 6514 | struct stud
{ int n;
int m;
int c;
int t;
}s[100000],temp;
void main()
{
int i,j,k,n,p;
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%d %d %d",&s[i].n,&s[i].m,&s[i].c);
s[i].t=s[i].m+s[i].c;
}
for(j=0;j<3&&j<n;j++)
{ for(k=j+1,p=j;k<n;k++)
if(s[p].t<s[k].t){p=k;}
temp=s[j];s[j]=s[p];s[p]=temp;
printf("%d %d\n",s[j].n,s[j].t);
}
} |
14 | 6515 | // ????????.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 | 6516 | 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 | 6517 | int main(int argc, char* argv[])
{
int i,j,n;
struct point
{
int m,x,y;
}a[100000],aa;
scanf ("%d",&n);
for (i=0;i<n;i++)
{
scanf ("%d%d%d",&a[i].m,&a[i].x,&a[i].y);
}
for(i=0;i<3;i++)
{
for (j=i+1;j<n;j++)
{
if ((a[i].x+a[i].y)<(a[j].x+a[j].y))
{
aa=a[j];
a[j]=a[i];
a[i]=aa;
}
}
}
for (i=0;i<3;i++)
{
printf ("%d %d\n",a[i].m,(a[i].x+a[i].y));
}
return 0;
}
|
14 | 6518 | 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 | 6519 | 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 | 6520 | struct student
{
long number;
int chinese;
int math;
int sum;
struct student *next;
struct student *last;
};
struct student *creat(int n)
{
struct student *head,*p1,*p2;
int i;
p1=(struct student *)malloc(len);
scanf("%d %d %d",&p1->number,&p1->chinese,&p1->math);
p1->sum=p1->chinese+p1->math;
p1->last=null;p1->next=null;
head=p1;p2=p1;
for(i=2;i<=n;i++)
{
p1=(struct student *)malloc(len);
scanf("%d %d %d",&p1->number,&p1->chinese,&p1->math);
p1->sum=p1->chinese+p1->math;
p1->last=p2;
p2->next=p1;
p1->next=null;
p2=p1;
}
return(head);
}
struct student *print(struct student *head)
{
struct student *max,*p;
p=head;max=head;
while(p)
{
if(p->sum>max->sum)max=p;
p=p->next;
}
printf("%d %d\n",max->number,max->sum);
if(max==head)
{
max->next->last=null;
head=max->next;
}
else
{
max->next->last=max->last;
max->last->next=max->next;
}
return(head);
}
void main()
{
int n;
struct student *head;
scanf("%d",&n);
head=creat(n);
print(head);
print(head);
print(head);
} |
14 | 6521 |
struct stu
{
int num;
int a;
int b;
int total;
int flag;
struct stu *next;
};
void main()
{
struct stu *p,*head;
struct stu *p1,*p2,*pmax;
int N,i;
int max;
scanf("%d",&N);
//??
p1=p2=(struct stu*)malloc(LEN);
scanf("%d%d%d",&p1->num,&p1->a,&p1->b);
p1->total=p1->a+p1->b;
p1->flag=0;
p1->next=NULL;
head=p1;
for(i=0;i<N-1;i++)
{
p2=p1;
p1=(struct stu *)malloc(LEN);
scanf("%d%d%d",&p1->num,&p1->a,&p1->b);
p1->total=p1->a+p1->b;
p1->flag=0;
p1->next=NULL;
p2->next=p1;
}
for(i=0;i<3;i++)
{
for(p=head,max=0;p!=NULL;p=p->next)
if(max<p->total&&p->flag==0)
{
max=p->total;
pmax=p;
}
pmax->flag=1;
printf("%d %d\n",pmax->num,pmax->total);
}
/* p=head;
do
{
printf("%d*,",p->num);
p=p->next;
}while(p!=NULL);*/
// for(i=0;i<3;i++)
// printf("%d %d\n",pmax[i]->num,pmax[i]->total);
} |
14 | 6522 | struct student
{
char num[6];
int score[2];
int sum;
} stu[100000];
void main()
{
long n,i,j,maxi1,maxi2,maxi3;
int max1=0,max2=0,max3=0;
scanf("%ld",&n);
for(i=0;i<n;i++)
{
scanf("%s",stu[i].num);
for(j=0;j<2;j++)
scanf("%d",&stu[i].score[j]);
}
for(i=0;i<n;i++)
stu[i].sum=stu[i].score[0]+stu[i].score[1];
for(i=0;i<n;i++)
if(stu[i].sum>max1)
{max1=stu[i].sum;
maxi1=i;
}
stu[maxi1].sum=0;
for(i=0;i<n;i++)
if(stu[i].sum>max2)
{max2=stu[i].sum;
maxi2=i;
}
stu[maxi2].sum=0;
for(i=0;i<n;i++)
if(stu[i].sum>max3)
{max3=stu[i].sum;
maxi3=i;
}
printf("%s %d\n%s %d\n%s %d",stu[maxi1].num,max1,stu[maxi2].num,max2,stu[maxi3].num,max3);
}
|
14 | 6523 | int main()
{
int n,i,j,q,w;
scanf("%d",&n);
int a[n],b[n],c[n],d[n];
for(i=0;i<n;i++)
{scanf("%d %d %d",&a[i],&b[i],&c[i]);
}
for(i=0;i<n;i++)
{ d[i]=b[i]+c[i];
}
for(i=0;i<3;i++)
{ for(j=i+1;j<n;j++)
{ if(d[i]<d[j])
{q=d[i];
d[i]=d[j];
d[j]=q;
w=a[i];
a[i]=a[j];
a[j]=w;}
}
}
for(i=0;i<3;i++)
{ printf("%d %d\n",a[i],d[i]);
}
getchar();
getchar();
getchar();
getchar();
getchar();
}
|
14 | 6524 | 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 | 6525 | 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 | 6526 | 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 | 6527 |
struct student{
int num;
int chin;
int math;
int sum;
};
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,e1,e2;
for(j=1;j<4;j++){
for(i=0;i<n-j;i++){
if(stu[i].sum>=stu[i+1].sum){
e1=stu[i+1].sum;
e2=stu[i+1].num;
stu[i+1].sum=stu[i].sum;
stu[i+1].num=stu[i].num;
stu[i].sum=e1;
stu[i].num=e2;
}
}
}
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 | 6528 | struct student
{
int id,word,math,sum;
}stu[100000];
void main()
{
int n,i=1,maxi;
scanf("%d",&n);
while(i<=n)
{
scanf("%d %d %d",&stu[i].id,&stu[i].word,&stu[i].math);
stu[i].sum=stu[i].word+stu[i].math;
i=i+1;
}
i=n;
stu[n+1].sum=0;
stu[n+2].sum=0;
stu[n+3].sum=0;
stu[n+1].id=0;
stu[n+2].id=0;
stu[n+3].id=0;
stu[n+1].math=0;
stu[n+2].math=0;
stu[n+3].math=0;
stu[n+1].word=0;
stu[n+2].word=0;
stu[n+3].word=0;
while(i>=1)
{
if(stu[i].sum>=stu[n+1].sum)
{ stu[n+1]=stu[i];
maxi=i;
}
i=i-1;
}
printf("%d %d\n",stu[n+1].id,stu[n+1].sum);
stu[maxi].sum=0;
i=n;
while(i>=1)
{
if(stu[i].sum>=stu[n+2].sum)
{ stu[n+2]=stu[i];
maxi=i;
}
i=i-1;
}
printf("%d %d\n",stu[n+2].id,stu[n+2].sum);
stu[maxi].sum=0;
i=n;
while(i>=1)
{
if(stu[i].sum>=stu[n+3].sum)
stu[n+3]=stu[i];
i=i-1;
}
printf("%d %d\n",stu[n+3].id,stu[n+3].sum);
}
|
14 | 6529 | struct marks
{
long ID;
int Chinese;
int Maths;
int total;
}student[100000],first,second,third;
void main()
{
first.total=0;
second.total=0;
third.total=0;
int student_num,i,count=0;
scanf("%ld",&student_num);
for(i=0;i<student_num;i++)
{
scanf("%ld%d%d",&student[i].ID,&student[i].Chinese,&student[i].Maths);
}
for(i=0;i<student_num;i++)
{
student[i].total=(student[i].Chinese+student[i].Maths);
}
for(i=0;i<student_num;i++)
{
if(student[i].total>first.total)
{
first=student[i];
}
}
for(i=0;i<student_num;i++)
{
if(student[i].total==first.total)
{count++;printf("%ld %d\n",student[i].ID,student[i].total);}
if(count>3) break;
}
for(i=0;i<student_num;i++)
{
if(student[i].total>second.total&&student[i].total<first.total)
{
second=student[i];
}
}
for(i=0;i<student_num;i++)
{
if(count>=3) break;
if(student[i].total==second.total)
{count++;printf("%ld %d\n",student[i].ID,student[i].total);}
}
for(i=0;i<student_num;i++)
{
if(student[i].total>third.total&&student[i].total<second.total)
{
third=student[i];
}
}
for(i=0;i<student_num;i++)
{
if(count>=3) break;
if(student[i].total==third.total)
{count++;printf("%ld %d\n",student[i].ID,student[i].total);}
}
} |
14 | 6530 | void main()
{
struct stu
{
long num,c,m,d;
struct stu *next;
};
long n,i,f;
struct stu *head,*p1,*p2;
scanf("%ld",&n);
for (i=1;i<=n;i++)
{
p1=(struct stu*)malloc(LEN);
scanf("%ld%ld%ld",&p1->num,&p1->c,&p1->m);
p1->d=p1->c+p1->m;
if (i==1)
{
p1->next=0;
head=p1;
}
else
{
if (i<=3) f=1;
else
{
p2=head->next->next;
if (p1->d>p2->d) f=1;
else f=0;
}
if (f==1)
{
p2=head;
if (p2->d<p1->d)
{
p1->next=p2;
head=p1;
}
else
{
while ((p2->next!=0)&&(p2->next->d>p1->d))
p2=p2->next;
p1->next=p2->next;
p2->next=p1;
}
}
}
}
p1=head;
for (i=1;i<=3;i++)
{
printf("%ld %ld\n",p1->num,p1->d);
p1=p1->next;
}
} |
14 | 6531 |
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 | 6532 |
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 | 6533 |
int main()
{
struct stu
{
int yu;
int shu;
char name[6];
};
struct stu s[100000],one,two,three;
one.yu=0;one.shu=0;
two.yu=0;two.shu=0;
three.yu=0;three.shu=0;
int n,j,k;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%s %d %d",s[j].name,&s[j].yu,&s[j].shu);
}
for(j=0;j<n;j++)
{
if((s[j].yu+s[j].shu)>(one.yu+one.shu))
{
one=s[j];
k=j;
}
}
s[k].yu=0;s[k].shu=0;
for(j=0;j<n;j++)
{
if((s[j].yu+s[j].shu)>(two.yu+two.shu))
{
two=s[j];
k=j;
}
}
s[k].yu=0;s[k].shu=0;
for(j=0;j<n;j++)
{
if((s[j].yu+s[j].shu)>(three.yu+three.shu))
three=s[j];
}
printf("%s %d\n%s %d\n%s %d\n",one.name,one.yu+one.shu,two.name,two.yu+two.shu,three.name,three.yu+three.shu);
return 0;
} |
14 | 6534 | struct stu
{
int ID;
int Chinese;
int math;
int sum;
}zz[100000],mx,mx1,mx2;
int main()
{
int n,i,j;
cin>>n;
for ( i = 0 ; i < n ; i ++ )
{
cin>>zz[i].ID>>zz[i].Chinese>>zz[i].math;
zz[i].sum = zz[i].Chinese + zz[i].math;
}
mx = zz[0];
for ( i = 0 ; i < n ; i ++ )
{
if ( zz[i].sum > mx.sum )
mx = zz[i];
}
cout<<mx.ID<<' '<<mx.sum<<endl;
mx.sum=0;
mx1 = mx;
for ( i = 0 ; i < n ; i ++ )
{
if ( zz[i].sum > mx1.sum )
{
if ( zz[i].ID == mx.ID )
continue;
mx1 = zz[i];
}
}
cout<<mx1.ID<<' '<<mx1.sum<<endl;
mx1.sum=0;
mx2 = mx1;
for ( i = 0 ; i < n ; i ++ )
{
if ( zz[i].sum > mx2.sum )
{
if ( zz[i].ID == mx.ID || zz[i].ID == mx1.ID)
continue;
mx2 = zz[i];
}
}
cout<<mx2.ID<<' '<<mx2.sum<<endl;
} |
14 | 6535 | 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 | 6536 |
struct student
{
int num,y,b,he;
}a[100003];
void main()
{
int n,i,j,he,k;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d %d %d",&a[i].num,&a[i].y,&a[i].b);
a[i].he=a[i].y+a[i].b;
};
for (i=1;i<=2;i++)
{
k=i;
for (j=i+1;j<=n;j++)
if (a[j].he>a[k].he) k=j;
printf("%d %d",a[k].num,a[k].he);
printf("\n");
a[k].he=0;
}
k=1;
for (j=i+1;j<=n;j++)
if (a[j].he>a[k].he) k=j;
printf("%d %d",a[k].num,a[k].he);
a[k].he=0;
} |
14 | 6537 | int main()
{
int n;
cin>>n;
struct student
{
int ID;
int chinese;
int math;
int total;
}score[100000];
for(int i=0;i<n;i++)
{
cin>>score[i].ID>>score[i].chinese>>score[i].math;
score[i].total=score[i].chinese+score[i].math;
}
for(int i=0;i<3;i++)
for(int j=n-1;j>0;j--)
if(score[j].total>score[j-1].total)
{
struct student temp=score[j];
score[j]=score[j-1];
score[j-1]=temp;
}
if(n==2)
for(int i=0;i<n;i++)
cout<<score[i].ID<<score[i].total<<endl;
else {
for(int i=0;i<3;i++)
cout<<score[i].ID<<' '<<score[i].total<<endl;
}
}
|
14 | 6538 | 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 | 6539 | int main()
{
struct st
{ int num;
int x;
int y;
int sum;
}a[100000],m1,m2,m3;
int n,i,j;
scanf("%d",&n);
for (i=0;i<n;i++)
{ scanf("%d %d %d",&a[i].num,&a[i].x,&a[i].y);
a[i].sum=a[i].x+a[i].y;
}
m1.sum=0; m2.sum=0; m3.sum=0;
for (i=0;i<n;i++)
if (a[i].sum>m1.sum) m1=a[i];
for (i=0;i<n;i++)
if ((a[i].sum>m2.sum)&&(a[i].sum<=m1.sum)&&(a[i].num!=m1.num)) m2=a[i];
for (i=0;i<n;i++)
if ((a[i].sum>m3.sum)&&(a[i].sum<=m2.sum)&&(a[i].num!=m2.num)&&(a[i].num!=m1.num)) m3=a[i];
printf("%d %d\n%d %d\n%d %d\n",m1.num,m1.sum,m2.num,m2.sum,m3.num,m3.sum);
return 0;
}
|
14 | 6540 | 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 | 6541 |
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 | 6542 | int main() {
struct stu{
int xh;
int yw;
int sx;
int zf;
}data[100000];
int n,i,max,x,j;
scanf ("%d",&n);
for(i=0;i<n;i++) {
scanf("%d %d %d",&data[i].xh,&data[i].yw,&data[i].sx);
data[i].zf=data[i].yw+data[i].sx;
}
for(i=0;i<3;i++) {
max=data[0].zf;
x=0;
for(j=1;j<n;j++) {
if(data[j].zf>max) {
max=data[j].zf;
x=j;
}
}
printf("%d %d\n",data[x].xh,data[x].zf);
data[x].zf=0;
}
}
|
14 | 6543 | struct student
{
int num;
int yuwen;
int math;
int total;
};
int main()
{
int n,i,j;
struct student stu[4],temp;
scanf("%d",&n);
for(i=0;i<3;i++)
stu[i].total=0;
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[3].num,&stu[3].yuwen,&stu[3].math);
stu[3].total=stu[3].yuwen+stu[3].math;
temp=stu[3];
for(j=2;j>=0;j--)
if(temp.total>stu[j].total)
{
stu[j+1]=stu[j];
stu[j]=temp;
}
else
{
stu[j+1]=temp;
break;
}
}
for(i=0;i<3;i++)
printf("%d %d\n",stu[i].num,stu[i].total);
return 0;
} |
14 | 6544 | int main(){
int n,i,j;
cin>>n;
struct student{
int number;
int maths;
int chinese;
int sum;
};
struct student stu[n],t;
for(i=0;i<n;i++) //???????
{cin>>stu[i].number>>stu[i].chinese>>stu[i].maths;
stu[i].sum=stu[i].chinese+stu[i].maths;
}
for(i=0;i<3;i++) //?????
for(j=n-2;j>=i;j--)
if(stu[j].sum<stu[j+1].sum)
{t=stu[j];
stu[j]=stu[j+1];
stu[j+1]=t;
}
if(n>=3)
for(i=0;i<3;i++) //???3?
cout<<stu[i].number<<' '<<stu[i].sum<<endl;
else
for(i=0;i<n;i++)
cout<<stu[i].number<<' '<<stu[i].sum<<endl;
return 0;
} |
14 | 6545 | int main(){
struct student{
int num;
int chs;
int math;
};
struct student s[100000];
struct student s1[2]={{0,0,0},{0,0,0}};
int n,i,t,j,a[100000],k=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&s[i].num,&s[i].chs,&s[i].math);
a[i]=s[i].chs+s[i].math;
}
for(i=0;i<3;i++){
for(j=0;j<n-1-i;j++){
if(a[j]>a[j+1]){
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
for(i=n-1;i>n-4;i--){
for(j=0;j<n;j++){
if(a[i]==s[j].chs+s[j].math&&s[j].num!=s1[0].num&&s[j].num!=s1[1].num){
printf("%d %d\n",s[j].num,s[j].chs+s[j].math);
s1[k]=s[j];
k++;
if(k==3){
goto end;
}
}
}
}
end:
return 0;
} |
14 | 6546 | //????????????
//??????
//?????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 | 6547 | 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 | 6548 |
struct stu
{
long int num;
int chi;
int mat;
int tot;
};
int main()
{
struct stu a[100050];
int n,k,i,j,temp2,max;
long int temp1;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%ld%d%d",&a[i].num,&a[i].chi,&a[i].mat);
a[i].tot=a[i].chi+a[i].mat;
}
for (j=1;j<=3;j++)
{
max=0;
a[0].tot=0;
for (i=1;i<=n;i++)
if (a[max].tot<a[i].tot) max=i;
printf("%ld %d\n",a[max].num,a[max].tot);
a[max].tot=0;
}
scanf("\n");
return(0);
} |
14 | 6549 | int main()
{
struct student{
int num;
int yw;
int sx;
int all;
}student[4]={0,0,0,0};
struct student temp={0,0,0,0};
int i, l,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&student[3].num,&student[3].yw,&student[3].sx);
student[3].all=student[3].yw+student[3].sx;
if(student[2].all<student[3].all)
{
temp=student[2];
student[2]=student[3];
student[3]=temp;
}
if(student[1].all<student[2].all)
{
temp=student[1];
student[1]=student[2];
student[2]=temp;
}
if(student[0].all<student[1].all)
{
temp=student[0];
student[0]=student[1];
student[1]=temp;
}
}
for(l=0;l<3;l++)
{
printf("%d %d\n",student[l].num,student[l].all);
}
} |
14 | 6550 | 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 | 6551 | /*
* score.cpp
*
* Created on: 2010-12-24
* Author: ???
* function: ????????
*/
int main()
{
int stuNum,i;
cin>>stuNum;
struct student{
int id,math,chinese,total;
};//??????student
struct student stu[stuNum],first,second,third;
for(i=0;i<stuNum;i++){//???????????????
cin>>stu[i].id>>stu[i].chinese>>stu[i].math;
stu[i].total=stu[i].chinese+stu[i].math;
}
//????????????
first=second=third=stu[0];
for(i=1;i<stuNum;i++)
if(stu[i].total>first.total) first=stu[i];
cout<<first.id<<' '<<first.total<<endl;
for(i=1;i<stuNum;i++)
if(stu[i].total>second.total&&stu[i].id!=first.id) second=stu[i];
cout<<second.id<<' '<<second.total<<endl;
for(i=1;i<stuNum;i++)
if(stu[i].total>third.total&&stu[i].id!=first.id&&stu[i].id!=second.id) third=stu[i];
cout<<third.id<<' '<<third.total<<endl;
return 0;
}
|
14 | 6552 |
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 | 6553 | struct Student
{
long Id;
int yuwen;
int shuxue;
};
int main()
{
int i,j;
long n;
struct Student student[NUM];
struct Student temp;
scanf("%ld\n",&n);
for(i=0;i<n;i++)
scanf("%ld%d%d",&student[i].Id,&student[i].yuwen,&student[i].shuxue);
for(i=0;i<3;i++)
{
for(j=0;j<(3-i-1);j++)
{
if((student[j+1].yuwen+student[j+1].shuxue)>(student[j].yuwen+student[j].shuxue))
{
temp=student[j+1];
student[j+1]=student[j];
student[j]=temp;
}
}
}
for(i=3;i<n;i++)
{
if((student[i].yuwen+student[i].shuxue)>(student[2].yuwen+student[2].shuxue))
{
student[2]=student[i];
}
if((student[i].yuwen+student[i].shuxue)>(student[1].yuwen+student[1].shuxue))
{
temp=student[1];
student[1]=student[i];
student[2]=temp;
}
if((student[i].yuwen+student[i].shuxue)>(student[0].yuwen+student[0].shuxue))
{
temp=student[0];
student[0]=student[i];
student[1]=temp;
}
}
for(i=0;i<3;i++)
{
printf("%ld %d\n",student[i].Id,(student[i].shuxue+student[i].yuwen));
}
return 0;
}
|
14 | 6554 | struct student
{
int number;
int yuwen;
int shuxue;
int sum;
struct student *next;
};
int n;
struct student*creat(void)
{struct student*head,*p1,*p2;
scanf("%d",&n);
p1=p2=(struct student*)malloc(LEN);
scanf("%d%d%d",&p1->number,&p1->yuwen,&p1->shuxue);
p1->sum=p1->yuwen+p1->shuxue;
head=p1;
int i;
for(i=1;i<n;i++)
{
p1=(struct student*)malloc(LEN);
p2->next=p1;
p2=p1;
scanf("%d%d%d",&p1->number,&p1->yuwen,&p1->shuxue);
p1->sum=p1->yuwen+p1->shuxue;
}
p2->next=null;
return head;
}
void compare(struct student*head)
{int max,i;
struct student*p;
for(i=1;i<=3;i++)
{max=0;
p=head;
while(p!=null)
{if(p->sum>max)max=p->sum;
p=p->next;
}
p=head;
while(p!=null)
{if(p->sum==max)
{printf("%d %d\n",p->number,max);
p->sum=0;
break;
}
p=p->next;
}
}
}
main()
{struct student*head;
head=creat();
compare(head);
}
|
14 | 6555 | /*
* structure_1.cpp
*
* Created on: 2010-12-29
* Author: ???
* ??? ????????
*/
int main(){
int n,i,j;
cin>>n;
struct student{ //?????????????????????
int id;
int cp;
int mp;
int tp;
} stu[n],temp;
for(i=0;i<n;i++){ //??????
cin>>stu[i].id>>stu[i].cp>>stu[i].mp;
stu[i].tp=stu[i].cp+stu[i].mp;
}
for(i=0;i<3;i++) //?????????
for(j=n-1;j>i;j--)
if(stu[j].tp>stu[j-1].tp){
temp=stu[j];
stu[j]=stu[j-1];
stu[j-1]=temp;
}
for(i=0;i<3;i++) //???????
cout<<stu[i].id<<' '<<stu[i].tp<<endl;
return 0;
}
|
14 | 6556 | struct student
{
int xuehao;
int yuwen;
int shuxue;
}stu[100000];
int main()
{
int sum[100000];
long i,j,n,t;
scanf ("%d",&n);
for (i=0;i<n;i++)
{
scanf ("%d %d %d",&stu[i].xuehao,&stu[i].yuwen,&stu[i].shuxue);
sum[i]=stu[i].yuwen+stu[i].shuxue;
}
for (i=0;i<3;i++)
{
t=0;
for (j=0;j<n-1;j++)
{
if (sum[j+1]>sum[t])
t=j+1;
}
printf ("%d %d\n",stu[t].xuehao,sum[t]);
sum[t]=0;
}
getchar();
getchar();
getchar();
}
|
14 | 6557 | int main()
{
int n,i,j;
float one=0,two=0,three=0,yi=0,er=0,san=0;
float a[100000][2];
scanf("%d",&n);
struct Student
{
float xuehao;
float yuwen;
float shuxue;
} student;
for (i=0;i<n;i++){
scanf("%f %f %f",&student.xuehao,&student.yuwen,&student.shuxue);
for (j=0;j<2;j++){
a[i][1]=student.yuwen+student.shuxue;
a[i][0]=i+1;
}
}
for (i=0;i<n;i++){
if (a[i][1]>one)
{ one=a[i][1];
yi=a[i][0]; }
}
for (i=0;i<n;i++){
if (a[i][1]>two&&a[i][1]<=one&&a[i][0]!=yi)
{ two=a[i][1];
er=a[i][0]; }
}
for (i=0;i<n;i++){
if (a[i][1]>three&&a[i][1]<=one&&a[i][1]<=two&&a[i][0]!=yi&&a[i][0]!=er)
{ three=a[i][1];
san=a[i][0]; }
}
printf("%.0f %.0f\n",yi,one);
printf("%.0f %.0f\n",er,two);
printf("%.0f %.0f\n",san,three);
return 0;
}
|
14 | 6558 |
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 | 6559 | struct student{
int num;
int chinese;
int math;
};
int main()
{
int n,i;
scanf("%d",&n);
struct student a[100000],e ;
for(i=0;i<n;i++){
scanf("%d %d %d",&a[i].num,&a[i].chinese,&a[i].math);
}
for(i=0;i<n-1;i++){
if(a[i].chinese+a[i].math>=a[i+1].chinese+a[i+1].math){
e=a[i];
a[i]=a[i+1];
a[i+1]=e;
}
}
for(i=0;i<n-2;i++){
if(a[i].chinese+a[i].math>=a[i+1].chinese+a[i+1].math){
e=a[i];
a[i]=a[i+1];
a[i+1]=e;
}
}
for(i=0;i<n-3;i++){
if(a[i].chinese+a[i].math>=a[i+1].chinese+a[i+1].math){
e=a[i];
a[i]=a[i+1];
a[i+1]=e;
}
}
for(i=n-1;i>n-4;i--){
printf("%d %d\n",a[i].num,a[i].chinese+a[i].math);
}
return 0;
}
|
14 | 6560 |
struct student
{
long int id;
int chinese;
int math;
};
main()
{
long int i,maxi1,maxi2,maxi3,num;
scanf("%d",&num);
struct student a[num];
for (i=0;i<num;i++)
scanf("%d %d %d",&a[i].id,&a[i].chinese,&a[i].math);
int maxpt1=0,maxpt2=0,maxpt3=0;
for (i=0;i<num;i++)
{
if (maxpt1<a[i].chinese+a[i].math)
{
maxpt3=maxpt2;
maxpt2=maxpt1;
maxpt1=a[i].chinese+a[i].math;
maxi3=maxi2;
maxi2=maxi1;
maxi1=a[i].id;
}
else if (maxpt2<a[i].chinese+a[i].math)
{
maxpt3=maxpt2;
maxpt2=a[i].chinese+a[i].math;
maxi3=maxi2;
maxi2=a[i].id;
}
else if (maxpt3<a[i].chinese+a[i].math)
{
maxpt3=a[i].chinese+a[i].math;
maxi3=a[i].id;
}
}
printf("%d %d\n%d %d\n%d %d",maxi1,maxpt1,maxi2,maxpt2,maxi3,maxpt3);
}
|
14 | 6561 | 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 | 6562 | /*
* ???: 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 | 6563 | struct student
{
long number;
int chinese;
int math;
int sum;
struct student *next;
struct student *previous;
};
struct student *creat(long n)
{
struct student *head,*p1,*p2;
int i;
head=null;
p1=(struct student *)malloc(len);
scanf("%d %d %d",&p1->number,&p1->chinese,&p1->math);
p1->sum=p1->chinese+p1->math;
p1->next=null;p1->previous=null;
head=p1;p2=p1;
for(i=2;i<=n;i++)
{
p1=(struct student *)malloc(len);
scanf("%d %d %d",&p1->number,&p1->chinese,&p1->math);
p1->sum=p1->chinese+p1->math;
p1->next=null;
p1->previous=p2;
p2->next=p1;
p2=p1;
}
return(head);
}
struct student *print(struct student *head)
{
struct student *max,*p;
max=head;
for(p=head;p!=null;p=p->next)
if(p->sum>max->sum) max=p;
printf("%d %d\n",max->number,max->sum);
if(max==head)
head=max->next;
else
max->previous->next=max->next;
return(head);
}
void main()
{
struct student *head;
long n;
scanf("%d",&n);
head=creat(n);
print(head);
print(head);
print(head);
} |
14 | 6564 | struct Student
{int num;
int yuwen;
int shuxue;
};
void fun(int*a,int*b);
int main()
{
int n,i,j;
int sum[100000];
scanf ("%d",&n);
struct Student stu[100000];
for (i=0;i<n;i++)
{
scanf ("%d%d%d",&stu[i].num,&stu[i].yuwen,&stu[i].shuxue);
sum[i]=stu[i].yuwen+stu[i].shuxue;
}
for(i=0;i<3;i++)
{
for(j=n-1;j>i;j--)
{
if(sum[j]>sum[j-1])
{
fun(&sum[j],&sum[j-1]);
fun(&stu[j-1].num,&stu[j].num);
fun(&stu[j-1].yuwen,&stu[j].yuwen);
fun(&stu[j-1].shuxue,&stu[j].shuxue);
}
}
}
for (i=0;i<3;i++)
printf ("%d %d\n",stu[i].num,sum[i]);
return 0;
}
void fun(int*a,int*b)
{
int k;
k=*a;
*a=*b;
*b=k;
} |
14 | 6565 | 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 | 6566 | 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 | 6567 | 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 | 6568 |
struct student{
int number,chinese,math,total;
}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].number,&stu[i].chinese,&stu[i].math);
stu[i].total=stu[i].chinese+stu[i].math;
}
int a=stu[0].total,b=stu[0].total,c=stu[0].total;
for(i=0;i<n;i++){
if(stu[i].total>a){
c=b;
b=a;
a=stu[i].total;
continue;
}
if(stu[i].total<a&&stu[i].total>b){
c=b;
b=stu[i].total;
continue;
}
if(stu[i].total<b&&stu[i].total>c){
c=stu[i].total;
continue;
}
}
int m=0;
for(i=0;i<n&&m<3;i++){
if(stu[i].total==a){
printf("%d %d\n",stu[i].number,stu[i].total);
m++;
}
}
for(i=0;i<n&&m<3;i++){
if(stu[i].total==b){
printf("%d %d\n",stu[i].number,stu[i].total);
m++;
}
}
for(i=0;i<n&&m<3;i++){
if(stu[i].total==c){
printf("%d %d\n",stu[i].number,stu[i].total);
m++;
}
}
return 0;
} |
14 | 6569 | 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 | 6570 | struct student
{
int num;
int liter;
int math;
int total;
};
int main()
{
int i,j,k,n;
struct student a[100000],n1,n2,n3;
scanf("%d",&n);
scanf("%d%d%d",&a[0].num,&a[0].liter,&a[0].math);
a[0].total=a[0].liter+a[0].math;
n1=n2=n3=a[0];
for(i=1;i<n;i++)
{
scanf("%d%d%d",&a[i].num,&a[i].liter,&a[i].math);
a[i].total=a[i].liter+a[i].math;
if(a[i].total>n1.total)
{
n3=n2;
n2=n1;
n1=a[i];
}
else if(a[i].total>n2.total)
{
n3=n2;
n2=a[i];
}
else if(a[i].total>n3.total)
n3=a[i];
}
printf("%d %d\n",n1.num,n1.total);
printf("%d %d\n",n2.num,n2.total);
printf("%d %d",n3.num,n3.total);
return 0;
} |
14 | 6571 | /*
* 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 | 6572 | 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 | 6573 |
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 | 6574 | 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 | 6575 |
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 | 6576 |
struct student
{
int num,chi,mat,tot;
}stu[100000];
int main()
{
void max(struct student [],int n);
int n,i,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[i].num,&stu[i].chi,&stu[i].mat);
stu[i].tot=stu[i].chi+stu[i].mat;
}
for(k=0;k<3;k++)
{
max(stu,n);
if(k<2)
printf("\n");
}
}
void max(struct student stu[],int n)
{
int i,j,max;
max=stu[0].tot;
for(i=0;i<n;i++)
if(stu[i].tot>max)
{
max=stu[i].tot;
j=i;
}
printf("%d %d",stu[j].num,max);
stu[j].tot=-1;
}
|
14 | 6577 | 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 | 6578 | 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 | 6579 | int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
struct student{
int a,b,c;
}student_1;
int x,i=0;
int a1=0,a2=0,b1=0,b2=0,c1=0,c2=0;
while(i<n){
scanf("%d%d%d",&student_1.a,&student_1.b,&student_1.c);
x=student_1.b+student_1.c;
if(x>a2){
c1=b1;
c2=b2;
b1=a1;
b2=a2;
a1=student_1.a;
a2=x;
}
else if(x==a2){
if (x > b2)
{
c1 = b1;
c2 = b2;
b1=student_1.a;
b2=x;
}
else if (x > c2)
{
c1 = student_1.a;
c2 = x;
}
}
else if(x>b2){
c1=b1;
c2=b2;
b1=student_1.a;
b2=x;
}
else if(x==b2){
if (x > c2)
{
c1=student_1.a;
c2=x;
}
}
else if(x>c2){
c1=student_1.a;
c2=x;
}
i++;
}
printf("%d %d\n",a1,a2);
printf("%d %d\n",b1,b2);
printf("%d %d\n",c1,c2);
return 0;
} |
14 | 6580 | 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 | 6581 |
struct student
{
int num;
int chinese;
int math;
int total;
}s[N];
int main()
{
int n,i,j,tn,tt;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d%d%d",&s[i].num,&s[i].chinese,&s[i].math);
s[i].total=s[i].math+s[i].chinese;
}
for (i=1;i<4;i++)
{
for (j=0;j<n-i;j++)
{
if (s[j].total>=s[j+1].total)
{
tt=s[j].total; tn=s[j].num;
s[j].total=s[j+1].total; s[j].num=s[j+1].num;
s[j+1].total=tt; s[j+1].num=tn;
}
}
}
printf("%d %d\n%d %d\n%d %d\n",s[n-1].num,s[n-1].total,s[n-2].num,s[n-2].total,s[n-3].num,s[n-3].total);
return (0);
} |
14 | 6582 | int main(){
struct student{
int stuno;
int score1;
int score2;
int score0;
};
int n,i,j,temp;
cin>>n;
struct student num[n];
for(i=0;i<n;i++){
cin>>num[i].stuno;
cin>>num[i].score1;
cin>>num[i].score2;
num[i].score0=num[i].score1+num[i].score2;
}
for(i=0;i<3;i++)
for(j=i+1;j<n;j++)
if(num[i].score0<num[j].score0){
temp=num[i].score0;
num[i].score0=num[j].score0;
num[j].score0=temp;
temp=num[i].stuno;
num[i].stuno=num[j].stuno;
num[j].stuno=temp;
}
for(i=0;i<3&&i<n;i++)
cout<<num[i].stuno<<" "<<num[i].score0<<endl;
return 0;
}
|
14 | 6583 | 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 | 6584 | int main()
{
int n,i,j,k,h,b;
scanf("%d",&n);
struct sb
{
int ID;
int m;
int c;
int sum;
}a[n];
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a[i].ID,&a[i].m,&a[i].c);
a[i].sum=a[i].m+a[i].c;
}
for(i=0,b=0;i<n;i++)
{
if(a[i].sum>b)
{
b=a[i].sum;
h=i;
}
}
printf("%d %d\n",a[h].ID,a[h].sum);
a[h].sum=-1;
for(i=0,b=0;i<n;i++)
{
if(a[i].sum>b)
{
b=a[i].sum;
h=i;
}
}
printf("%d %d\n",a[h].ID,a[h].sum);
a[h].sum=-1;
for(i=0,b=0;i<n;i++)
{
if(a[i].sum>b)
{
b=a[i].sum;
h=i;
}
}
printf("%d %d\n",a[h].ID,a[h].sum);
getchar();
getchar();
} |
14 | 6585 | 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 | 6586 | int main()
{
struct {
int ID;
int ch,math;
int sum;
}a[100000];
int n,m1,m2,m3,x,y,z;
scanf("%d",&n);
scanf("%d %d %d",&a[0].ID,&a[0].ch,&a[0].math);
m1=a[0].ch+a[0].math;
int i;
for(i=0;i<n;i++)
{
scanf("%d %d %d",&a[i].ID,&a[i].ch,&a[i].math);
a[i].sum=a[i].ch+a[i].math;
if(a[i].sum>m1)
{
m1=a[i].sum;
x=i;
}
}
printf("%d %d\n",a[x].ID,m1);
a[x].ch=a[x].math=a[x].sum=0;
int j;
scanf("%d %d %d",&a[0].ID,&a[0].ch,&a[0].math);
m2=a[0].sum;
for(j=0;j<n;j++)
{
scanf("%d %d %d",&a[j].ID,&a[j].ch,&a[j].math);
a[j].sum=a[j].ch+a[j].math;
if(a[j].sum>m2)
{
m2=a[j].sum;
y=j;
}
}
printf("%d %d\n",a[y].ID,m2);
a[y].ch=a[y].math=a[y].sum=0;
int k;
scanf("%d %d %d",&a[0].ID,&a[0].ch,&a[0].math);
m3=a[0].sum;
for(k=0;k<n;k++)
{
scanf("%d %d %d",&a[k].ID,&a[k].ch,&a[k].math);
a[k].sum=a[k].ch+a[k].math;
if(a[k].sum>m3)
{
m3=a[k].sum;
z=k;
}
}
printf("%d %d\n",a[z].ID,m3);
return 0;
}
|
14 | 6587 | struct student
{
int number;
int score1;
int score2;
};
struct student stu[100000];
int main()
{
int n,i,first=0,second=0,third=0,a[100000];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].number,&stu[i].score1,&stu[i].score2);
a[i]=stu[i].score1+stu[i].score2;
}
for(i=0;i<n-1;i++)
{
if(a[first]<a[i])
{
third=second;
second=first;
first=i;
}
else if(a[second]<a[i])
{
third=second;
second=i;
}
else if(a[third]<a[i])
{
third=i;
}
}
printf("%d %d\n%d %d\n%d %d\n",stu[first].number,a[first],stu[second].number,a[second],stu[third].number,a[third]);
return(0);
} |
14 | 6588 | struct stu
{
int num;
int score1;
int score2;
}
main()
{
struct stu damn[4];
int n,i,j,total;
scanf("%d",&n);
for(i=0;i<3;i++) scanf("%d %d %d",&damn[i].num,&damn[i].score1,&damn[i].score2);
for(i=0;i<2;i++)
{
for(j=0;j<2-i;j++)
{
if(damn[j].score1+damn[j].score2<damn[j+1].score1+damn[j+1].score2)
{
damn[3]=damn[j];
damn[j]=damn[j+1];
damn[j+1]=damn[3];
}
}
}
for(i=0;i<n-3;i++)
{
scanf("%d %d %d",&damn[3].num,&damn[3].score1,&damn[3].score2);
if(damn[3].score1+damn[3].score2<damn[2].score1+damn[2].score2) continue;
else if(damn[3].score1+damn[3].score2<=damn[1].score1+damn[1].score2&&damn[3].score1+damn[3].score2>damn[2].score1+damn[2].score2)
{
damn[2]=damn[3];
}
else if(damn[3].score1+damn[3].score2<=damn[0].score1+damn[0].score2&&damn[3].score1+damn[3].score2>damn[1].score1+damn[1].score2)
{
damn[2]=damn[1];
damn[1]=damn[3];
}
else if(damn[3].score1+damn[3].score2>damn[0].score1+damn[0].score2)
{
damn[2]=damn[1];
damn[1]=damn[0];
damn[0]=damn[3];
}
}
for(i=0;i<2;i++)
{
total=damn[i].score1+damn[i].score2;
printf("%d %d\n",damn[i].num,total);
}
total=damn[i].score1+damn[i].score2;
printf("%d %d",damn[i].num,total);
}
|
14 | 6589 | struct student
{
char number[20];
int chinese;
int math;
int sum;
struct student *next;
}stu[100000],*s1,*s2,*s3;
int n,max1=0,max2=0,max3=0;
struct student *creat(void)
{
int i;
struct student *head,*p1,*p2;
p1=p2=(struct student*)malloc(LEN);
for(i=0;i<n;i++)
{
scanf("%s%d%d",&p1->number,&p1->chinese,&p1->math);
p2=p1;
p1->sum=p1->chinese+p1->math;
if(p1->sum>max1)
{max3=max2;s3=s2;max2=max1;s2=s1;max1=p1->sum;s1=p1;}
else if(p1->sum>max2)
{max3=max2;s3=s2;max2=p1->sum;s2=p1;}
else if(p1->sum>max3)
{max3=p1->sum;s3=p1;}
if(i==0)head=p1;
else p2->next=p1;
p1=(struct student*)malloc(LEN);
}
p1=NULL;
return(head);
}
void main()
{
struct student *p;
scanf("%d",&n);
p=creat();
printf("%s %d\n",s1->number,s1->sum);
printf("%s %d\n",s2->number,s2->sum);
printf("%s %d",s3->number,s3->sum);
}
|
14 | 6590 | 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 | 6591 | 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 | 6592 | void main()
{
struct student
{
int xh;
int yw;
int sx;
int zf;
struct student *next;
};
int i,j,k,n,m,max;
struct student *p1,*p2,*head;
scanf("%d",&n);
head=p1=p2=(struct student *)malloc(sizeof(struct student));
scanf("%d %d %d",&p1->xh,&p1->yw,&p1->sx);
p1->zf=p1->yw+p1->sx;
for(i=2;i<=n;i++)
{
p1=(struct student *)malloc(sizeof(struct student));
scanf("%d %d %d",&p1->xh,&p1->yw,&p1->sx);
p1->zf=p1->yw+p1->sx;
p2->next=p1;
p2=p1;
if(i==n)p1->next=0;
}
p1=head;
for(i=1;i<=3;i++)
{
p1=head;
max=0;
for(j=1;j<=n;j++)
{
max=max>p1->zf?max:p1->zf;
p1=p1->next;
}
//printf("%d\n",max);
p1=head;
for(j=1;j<=n;j++)
{
if(p1->zf==max)
{
printf("%d %d\n",p1->xh,p1->zf);
p1->zf=0;
break;
}
p1=p1->next;
}
}
} |
14 | 6593 | struct stu
{int xuehao,yuwen,shuxue,sum;
struct stu *next;
};
void max(struct stu *h)
{
struct stu *a,*b,*c,*d;
int m=0;
a=h;
do
{
c=a;
a=a->next;
if(m<a->sum)
{
m=a->sum;
d=c;
b=a;
}
}while(a->next);
printf("%d %d\n",b->xuehao,b->sum);
d->next=b->next;
free(b);
}
void main()
{
struct stu *head,*p,*q;
int n,i;
scanf("%d",&n);
head=M;
p=M;
head->next=p;
for(i=0;i<n;i++){
scanf("%d %d %d",&p->xuehao,&p->yuwen,&p->shuxue);
p->sum=p->yuwen+p->shuxue;
q=M;
p->next=q;
p=q;
}
p->next=NULL;
max(head);
max(head);
max(head);
}
|
14 | 6594 | 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 | 6595 |
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 | 6596 | struct
{
int x;
int y;
int s;
int z;
}a[100010],t;
int main()
{
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].s);
a[i].z=a[i].y+a[i].s;
}
for(i=0;i<=2;i++)
for(j=n-1;j>=i;j--)
{
if(a[j+1].z>a[j].z)
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
printf("%d %d\n",a[0].x,a[0].z);
printf("%d %d\n",a[1].x,a[1].z);
printf("%d %d\n",a[2].x,a[2].z);
return 0;
}
|
14 | 6597 | struct student
{
int num;
int chinese;
int maths;
int sum;};
int main()
{ struct student stu[4]={0,0,0,0};
struct student temp[4]={0,0,0,0};
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[3].num,&stu[3].chinese,&stu[3].maths);
stu[3].sum=stu[3].chinese+stu[3].maths;
//printf("%d",stu[3].chinese);
if(stu[3].sum>stu[0].sum)
{stu[2]=stu[1];stu[1]=stu[0];stu[0]=stu[3];}
else if(stu[3].sum>stu[1].sum)
{stu[2]=stu[1];stu[1]=stu[3];}
else if(stu[3].sum>stu[2].sum)
{stu[2]=stu[3];}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",stu[i].num,stu[i].sum);
}
return 0;
} |
14 | 6598 | 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 | 6599 | 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;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.