id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
6,800 | 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 |
6,801 |
struct stu* create();
int compare (const void * a, const void * b);
int main()
{
int i,j=0,n;
scanf("%d", &n);
struct stu{
int num;
int chi;
int math;
int total;
};
struct stu *p=(struct stu*)calloc( n,sizeof(struct stu) );
struct stu *a=p;
int *tot=(int *)calloc( n, sizeof(int) );
for(i=0;i<n;i++){
scanf("%d %d %d", &p->num, &p->chi, &p->math);
*(tot+i) = p->total = p->chi + p->math;
p++;
}
qsort(tot, n, sizeof(int), compare);
for(i=0;i<3;i++,j=0){
while( (a+(j++))->total != *(tot+i) )
;
printf("%d %d\n", (a+j-1)->num, (a+j-1)->total);
(a+j-1)->total=-1;
}
return 0;
}
int compare (const void * a, const void * b)
{
return ( *(int*)b - *(int*)a );
} | 14 |
6,802 |
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 |
6,803 | struct student
{
int num;
int chinese;
int math;
int total;
}a[100000];
int main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&a[i].num,&a[i].chinese,&a[i].math);
a[i].total=a[i].chinese+a[i].math;
}
int max,numm;
max=a[1].total;
for(int j=0;j<3;j++)
{
for(i=0;i<n;i++)
{
if(max<a[i].total)
{
max=a[i].total;
numm=i;
}
}
printf("%d %d\n",numm+1,max);
a[numm].total=0;
max=0;
}
return 0;
}
| 14 |
6,804 | struct stu
{
int a;
int b;
int c;
struct stu *next;
};
void main()
{
int i,j,n,t,sum[100000];
struct stu *head,*p1,*p2;
scanf("%d",&n);
p1=(struct stu*)malloc(sizeof(struct stu));
scanf("%d%d%d",&(p1->a),&(p1->b),&(p1->c));
sum[0]=p1->b+p1->c;
head=p1;
p2=p1;
for(i=1;i<n;i++)
{
p1=(struct stu*)malloc(sizeof(struct stu));
p2->next=p1;
scanf("%d%d%d",&(p1->a),&(p1->b),&(p1->c));
sum[i]=p1->b+p1->c;
p2=p1;
}
p2->next=NULL;
for(i=0;i<3;i++)
for(j=i+1;j<n;j++)
if(sum[i]<sum[j])
{
t=sum[i];
sum[i]=sum[j];
sum[j]=t;
}
for(i=0;i<3;i++)
{
p1=head;
while(p1->b+p1->c!=sum[i]&&p1)
{
p1=p1->next;
}
if(p1)
{
printf("%d %d\n",p1->a,sum[i]);
p1->b=0;
p1->c=0;
}
}
} | 14 |
6,805 | struct grade
{
char ID[20];
int math,cn;
};
int main(){
int n,i,j,max,m;
int *s;
struct grade stu[100000];
scanf("%d",&n);
s=(int*)malloc(n*sizeof(int));
if(n==1){
scanf("%s %d %d",stu[0].ID,&stu[0].math,&stu[0].cn);
printf("%s %d",stu[0].ID,stu[0].math+stu[0].cn);
}
else if(n==2){
scanf("%s %d %d",stu[0].ID,&stu[0].math,&stu[0].cn);
scanf("%s %d %d",stu[1].ID,&stu[1].math,&stu[1].cn);
if(stu[0].math+stu[0].cn>stu[1].math+stu[1].cn){
printf("%s %d\n",stu[0].ID,stu[0].math+stu[0].cn);
printf("%s %d\n",stu[1].ID,stu[1].math+stu[1].cn);
}else{
printf("%s %d\n",stu[0].ID,stu[0].math+stu[0].cn);
printf("%s %d\n",stu[1].ID,stu[1].math+stu[1].cn);
}
}
else if(n>=2){
for(i=0;i<n;i++){
scanf("%s %d %d",stu[i].ID,&stu[i].math,&stu[i].cn);
s[i]=stu[i].math+stu[i].cn;
}
for(i=1;i<4;i++){
max=s[0];
for(j=1;j<n;j++){
if(s[j]>max){
max=s[j];
m=j;
}
}
printf("%s %d\n",stu[m].ID,max);
s[m]=0;
}
}
return 0;
} | 14 |
6,806 | struct stu
{
int no;
int chi;
int math;
int sum;
struct stu *next;
};
void main()
{
struct stu a,*head,*p,*tail,*q;
int k,i,m1,m2,m3,n1,n2,n3,temp1,temp2;
head=NULL;
scanf("%d",&k);
for(i=0;i<k;i++)
{
p=(struct stu*)malloc(LEN);
scanf("%d %d %d",&p->no,&p->chi,&p->math);
p->sum=(p->chi+p->math);
if(head==NULL)
head=tail=p;
else
{
tail->next=p;
tail=p;
tail->next=&a;
}
}
a.next=NULL;
p=head;
for(q=p->next;q->next!=NULL;q=q->next)
{
if(p->sum<q->sum)
{
temp1=q->sum;
q->sum=p->sum;
p->sum=temp1;
temp2=q->no;
q->no=p->no;
p->no=temp2;
}
}
m1=p->no;
n1=p->sum;
head=p->next;
p=head;
for(q=p->next;q->next!=NULL;q=q->next)
{
if(p->sum<q->sum)
{
temp1=q->sum;
q->sum=p->sum;
p->sum=temp1;
temp2=q->no;
q->no=p->no;
p->no=temp2;
}
}
m2=p->no;
n2=p->sum;
head=p->next;
p=head;
for(q=p->next;q->next!=NULL;q=q->next)
{
if(p->sum<q->sum)
{
temp1=q->sum;
q->sum=p->sum;
p->sum=temp1;
temp2=q->no;
q->no=p->no;
p->no=temp2;
}
}
m3=p->no;
n3=p->sum;
printf("%d %d\n%d %d\n%d %d\n",m1,n1,m2,n2,m3,n3);
} | 14 |
6,807 | 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 |
6,808 | /*
* xue sheng cheng ji tong ji.cpp
*
* Created on: 2010-12-26
* Author: taoshibo
*/
int main() {
int n = 0, i = 0, j = 0;
cin >> n;
struct student {//??????????????
int stuid;
int chin;
int math;
} stu[n], t;
for (i = 0; i < n; i++) {//???? ???????
cin >> stu[i].stuid >> stu[i].chin >> stu[i].math;
}
for (i = 0; i < 3; i++)//?????
for (j = 0; j < n - 1; j++)
if ((stu[j].chin + stu[j].math) >= (stu[j + 1].chin
+ stu[j + 1].math)) {
t = stu[j];
stu[j] = stu[j + 1];
stu[j + 1] = t;
}
for (i = n-1; i > n-4; i--)//?????
cout << stu[i].stuid << " " << stu[i].chin + stu[i].math << endl;
return 0;
}
| 14 |
6,809 | int n,max1,xue1,max2,xue2,max3,xue3;
struct chengji
{
int xh;
int yw;
int sx;
int zf;
struct chengji *next;
};
void create()
{
struct chengji *head;
struct chengji *p1;
int i=0;
while(i<n)
{ i++;
if (i==1) head=p1;
p1=(struct chengji *)malloc(len);
scanf("%d %d %d",&p1->xh,&p1->yw,&p1->sx);
p1->zf=p1->yw+p1->sx;
if ((p1->zf)>max1)
{
xue3=xue2;
max3=max2;
xue2=xue1;
max2=max1;
xue1=p1->xh;
max1=p1->zf;
}
else
{if ((p1->zf)>max2&&(p1->zf)<=max1)
{
xue3=xue2;
max3=max2;
xue2=p1->xh;
max2=p1->zf;
}
else {if ((p1->zf)>max3&&(p1->zf)<=max2)
{
xue3=p1->xh;
max3=p1->zf;
}}}
p1=p1->next;
}
}
void main()
{
scanf("%d",&n);
max1=0,max2=0,max3=0;
create();
printf("%d %d\n",xue1,max1);
printf("%d %d\n",xue2,max2);
printf("%d %d",xue3,max3);
} | 14 |
6,810 | int main () {
int n,c,m;
cin>>n;
struct student
{
int id;
int total;
}; //?????
struct student stu[n+1];//??????
int i,j;
for(i=0;i<n;i++){
cin>>stu[i].id>>c>>m;
stu[i].total=c+m;//?????????
}
for(i=n-1;i>n-4;i--)
for(j=n-1;j>n-i-1;j--)
{
if(stu[j].total>stu[j-1].total){
stu[n]=stu[j];
stu[j]=stu[j-1];
stu[j-1]=stu[n];
}
}//????
for(i=0;i<3;i++){
if(i<n)
cout<<stu[i].id<<" "<<stu[i].total<<endl;//?????
}
return 0;
}
| 14 |
6,811 | 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 |
6,812 | struct linknode *CreateLinkList();
void DisplayLinkList(struct linknode *linklist1);
void qiansan(struct linknode *linklist2);
struct linknode
{
int id;
int chinese;
int math;
int total;
int mark;
struct linknode *next;
};
int main()
{
qiansan(CreateLinkList());
}
struct linknode *CreateLinkList()
{
long n,i;
struct linknode *head,*p;
scanf("%ld",&n);
head=(struct linknode *)malloc(sizeof(struct linknode));
p=head;
if (p==NULL)
{
printf("fail");
exit(-1);
}
for(i=1;i<=n;i++)
{
scanf("%d %d %d",&p->id,&p->chinese,&p->math);
p->total=p->chinese+p->math;
p->mark=0;
if (i==n)
p->next=NULL;
else
{
p->next=(struct linknode *)malloc(sizeof(struct linknode));
p=p->next;
}
}
return head;
}
void qiansan(struct linknode *linklist2)
{
struct linknode *head,*p,*max;
head=linklist2;
p=head;
max=(struct linknode *)malloc(sizeof(struct linknode));
int j;
for (j=1;j<=3;j++)
{
p=head;
max->total=0;
while (p!=NULL)
{
if (p->total>max->total&&p->mark==0)
{
max=p;
}
p=p->next;
}
max->mark=1;
printf("%d %d\n",max->id,max->total);
}
} | 14 |
6,813 | struct student
{
int id;
int ch;
int math;
};
void main()
{
struct student stu[100000];
int n,i,j,sum=0,id1=0,flag=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d",&stu[i].id,&stu[i].ch,&stu[i].math);
for(i=0;i<3;i++)
{
for(j=0;j<n;j++)
{
if((stu[j].ch+stu[j].math)>sum)
{sum=stu[j].ch+stu[j].math;
id1=stu[j].id;
flag=j;}
}
printf("%d %d\n",id1,sum);
sum=0;
id1=0;
stu[flag].ch=0;
stu[flag].math=0;
flag=0;
}
}
| 14 |
6,814 | 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 |
6,815 | void main()
{
int n,i,j,t;
struct score
{int num;
int verbal;
int math;
int sum;
};
struct score a[4];
scanf("%d",&n);
for(i=0;i<=2;i++)
{
scanf("%d%d%d",&a[i].num,&a[i].verbal,&a[i].math);
a[i].sum=a[i].verbal+a[i].math;
}
for(i=0;i<=1;i++)
for(j=1;j<=2-i;j++)
{
if(a[i].verbal+a[i].math<a[i+j].verbal+a[i+j].math)
{
t=a[i].num;
a[i].num=a[i+j].num;
a[i+j].num=t;
t=a[i].sum;
a[i].sum=a[i+j].sum;
a[i+j].sum=t;
}
}
for(i=3;i<n;i++)
{
scanf("%d%d%d",&a[3].num,&a[3].verbal,&a[3].math);
if(a[3].verbal+a[3].math>a[0].sum)
{
t=a[1].num;
a[1].num=a[0].num;
a[2].num=t;
a[0].num=a[3].num;
t=a[1].sum;
a[1].sum=a[0].sum;
a[2].sum=t;
a[0].sum=a[3].verbal+a[3].math;
}
else if(a[3].verbal+a[3].math>a[1].sum)
{
a[2].num=a[1].num;
a[1].num=a[3].num;
a[2].sum=a[1].sum;
a[1].sum=a[3].verbal+a[3].math;
}
else if(a[3].verbal+a[3].math>a[2].sum)
{
a[2].num=a[3].num;
a[2].sum=a[3].verbal+a[3].math;
}
}
for(i=0;i<=2;i++)
printf("%d %d\n",a[i].num,a[i].sum);
} | 14 |
6,816 |
int main()
{
struct student
{int num;
int chi;
int math;
}stu[100000];
int n,i,j,mid;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&stu[i].num,&stu[i].chi,&stu[i].math);
}
for(i=0;i<3;i++){
for(j=n-1;j>0;j--){
if(stu[j].math+stu[j].chi>stu[j-1].chi+stu[j-1].math){
mid=stu[j].num;
stu[j].num=stu[j-1].num;
stu[j-1].num=mid;
mid=stu[j].chi;
stu[j].chi=stu[j-1].chi;
stu[j-1].chi=mid;
mid=stu[j].math;
stu[j].math=stu[j-1].math;
stu[j-1].math=mid;
}
}
}
for(i=0;i<3;i++){
printf("%d %d\n",stu[i].num,stu[i].math+stu[i].chi);
}
return 0;
}
| 14 |
6,817 | 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 |
6,818 | struct score {
int id;
int chinese;
int maths;
int sum;
};
int main() {
score *p[100000], *temp, stu[100000];
int i, j, n;
cin >> n;
for (i = 0; i < n; i++) { //????p????stu??
p[i] = &stu[i];
cin >> p[i]->id >> p[i]->chinese >> p[i]->maths;
p[i]->sum = p[i]->chinese + p[i]->maths;
}
for (i = 0; i < 3; i++) //???????????
for (j = n - 1; j > i; j--)
if (p[j]->sum > p[j - 1]->sum) { //????????????
temp = p[j];
p[j] = p[j - 1];
p[j - 1] = temp;
}
for (i = 0; i < 3; i++) //?????
cout << p[i]->id << ' ' << p[i]->sum << endl;
return 0;
}
| 14 |
6,819 |
struct student
{
int num ;
int chinese ;
int math ;
int sum ;
}s[100001] , first , second , third ; //??????? ?? ?? ??
int main()
{
int n , i , temp1 , temp2 ;
cin >> n ;
for (i = 0 ; i < n ; i++)
{
cin >> s[i].num >> s[i].chinese >> s[i].math ;
s[i].sum = s[i].chinese + s[i].math ; //??=?????
}
first.sum = 0 , second.sum = 0 , third.sum = 0 ; //???????
for (i = 0 ; i < n ; i++)
{
if (first.sum < s[i].sum)
{
first = s[i] ;
temp1 = i ; //?????????
}
}
for (i = 0 ; i < n ; i++)
{
if (second.sum < s[i].sum && s[i].num != s[temp1].num) //????????????????????????????
{
second = s[i];
temp2 = i ;
}
}
for (i = 0 ; i < n ; i++)
if (third.sum < s[i].sum && s[i].num != s[temp1].num && s[i].num != s[temp2].num) //?????
third = s[i];
cout << first.num << " " << first.sum << endl ;
cout << second.num << " " << second.sum << endl ;
cout << third.num << " " << third.sum << endl ;
return 0 ;
}
| 14 |
6,820 | struct student
{
int No;
int chinese;
int math;
int all;
}stu[STUDENT_NUM],temp;
void main()
{
int n;
scanf("%d",&n);
int i,k;
for(i=0;i<n;i++){
scanf("%d%d%d",&stu[i].No,&stu[i].chinese,&stu[i].math);
stu[i].all=stu[i].chinese+stu[i].math;
}
for(k=1;k<4;k++){
for(i=0;i<n-k;i++){
if(stu[i].all>=stu[i+1].all){
temp=stu[i+1];
stu[i+1]=stu[i];
stu[i]=temp;
}
}
}
for(i=n-1;i>n-4;i--){
printf("%d %d\n",stu[i].No,stu[i].all);
}
} | 14 |
6,821 |
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 |
6,822 | void main()
{
int i,n,j,max;
scanf("%d",&n);
struct student
{
int num;
int yuwen;
int shuxue;
struct student * next;
};
struct student *head,*ppre,*p0,*p3;
struct student *p1,*p2;
head=p1=p2=(struct student *)malloc(sizeof(struct student));
for(i=0;i<n;i++)
{
scanf("%d %d %d",&p1->num,&p1->yuwen,&p1->shuxue);
p1=(struct student *)malloc(sizeof(struct student));
p2->next=p1;
p2=p1;
}
p2->next=NULL; /*????*/
for(j=0;j<3;j++)
{
ppre=p1=head;
max=p1->yuwen+p1->shuxue;
p1=p1->next;
for(i=0;i<n-j;i++)
{
if((p1->yuwen+p1->shuxue)>max)
{
max=p1->yuwen+p1->shuxue;
p0=p1;
p3=ppre;
}
ppre=p1;
p1=p1->next;
}
printf("%d %d\n",p0->num,max);
p3->next=p0->next;
}
}
| 14 |
6,823 |
struct Top
{
int num;
float score;
}Top[4]={{0,0}};
struct Top *p;
void maopao(int n)
{
int i;
for(i=1; i<n; i++)
{
for(p=Top; p<Top+n-i; p++)
{
if((p->score) < ((p+1)->score))
{
Top[3]=*p;
*p=*(p+1);
*(p+1)=Top[3];
}
}
}
}
void sort(float a, int n)
{
p=Top+2;
if(a > (p->score))
{
p->score=a;
p->num=n;
}
maopao(3);
}
int main()
{
int i, n, num;
float yw, sx, score;
scanf("%d\n", &n);
for(i=0;i<n;i++)
{
scanf("%d %f %f", &num, &yw, &sx);
float score=yw+sx;
sort(score, num);
}
for(p=Top;p<Top+3;p++)
{
printf("%d %g\n", p->num, p->score);
}
return 0;
} | 14 |
6,824 | int main()
{
struct student
{
int num;
int yuwen;
int math;
int zong;
};
struct student stu[100000];
struct student *p,*p1,*p2,*p3,*p4;
int n;
scanf("%d",&n);
for(p=stu;p<stu+n;p++)
{
scanf("%d",&p->num);
scanf("%d",&p->yuwen);
scanf("%d",&p->math);
}
for(p=stu;p<stu+n;p++)
{
(p->zong)=(p->yuwen)+(p->math);
}
p1=&stu[0];
p2=&stu[1];
p3=&stu[2];
p4=p1;
if(p2->zong>p1->zong)
{
p4=p1;
p1=p2;
p2=p4;
}
else
p1=p1;
if(p3->zong>p1->zong)
{
p4=p1;
p1=p3;
p3=p4;
}
else
p1=p1;
if(p3->zong>p2->zong)
{
p4=p2;
p2=p3;
p3=p4;
}
else
p1=p1;
for(p=stu+3;p<stu+n;p++)
{
if((p->zong)>(p1->zong))
{
p3=p2;
p2=p1;
p1=p;
}
else if(p->zong>p2->zong)
{
p3=p2;
p2=p;
}
else if(p->zong>p3->zong)
{
p3=p;
}
else
p1=p1;
}
printf("%d %d\n",p1->num,p1->zong);
printf("%d %d\n",p2->num,p2->zong);
printf("%d %d",p3->num,p3->zong);
return 0;
} | 14 |
6,825 | int main(int argc, char* argv[])
{
int a=0,b=0,c=0;
int an,bn,cn;
int n,i,sum=0;
struct student{
int num,ch,math;
}students[100000];
scanf("%d",&n);
for (i=0; i<n; i++){
scanf("%d%d%d",&students[i].num, &students[i].ch, &students[i].math);
sum = students[i].ch + students[i].math;
if (sum > c){
c = sum;
cn = i;
}
if (sum > b){
c = b;
cn = bn;
b = sum;
bn = i;
}
if (sum > a){
b = a;
bn =an;
a = sum;
an = i;
}
}
printf("%d %d\n",students[an].num,a);
printf("%d %d\n",students[bn].num,b);
printf("%d %d\n",students[cn].num,c);
return 0;
}
| 14 |
6,826 |
int main()
{
struct ss{
int num,yu,sh;
int sum;
};
int n,i;
struct ss *stu;
scanf("%d",&n);
stu=(struct ss *)malloc(sizeof(ss)*n);
for(i=0;i<n;i++)
{int num1,yu1,sh1;
(stu+i)->num=0;
(stu+i)->yu=0;
(stu+i)->sh=0;
(stu+i)->sum=0;
scanf("%d %d %d",&num1,&yu1,&sh1);
(stu+i)->num=num1;
(stu+i)->yu=yu1;
(stu+i)->sh=sh1;
(stu+i)->sum=yu1+sh1;
}
for(i=1;i<n;i++)
{int t;
if((stu+0)->sum<(stu+i)->sum)
{t=(stu+0)->sum;
(stu+0)->sum=(stu+i)->sum;
(stu+i)->sum=t;
t=(stu+0)->num;
(stu+0)->num=(stu+i)->num;
(stu+i)->num=t;}}
for(i=2;i<n;i++)
{int t;
if((stu+1)->sum<(stu+i)->sum)
{t=(stu+1)->sum;
(stu+1)->sum=(stu+i)->sum;
(stu+i)->sum=t;
t=(stu+1)->num;
(stu+1)->num=(stu+i)->num;
(stu+i)->num=t;}}
for(i=3;i<n;i++)
{int t;
if((stu+2)->sum<(stu+i)->sum)
{t=(stu+2)->sum;
(stu+2)->sum=(stu+i)->sum;
(stu+i)->sum=t;
t=(stu+2)->num;
(stu+2)->num=(stu+i)->num;
(stu+i)->num=t;}}
for(i=0;i<3;i++)
{ printf("%d %d\n",(stu+i)->num,(stu+i)->sum);}
free(stu);
return 0;
}
| 14 |
6,827 | struct student
{
int id;
int china;
int math;
int total;
}stu[M],temp;
int main()
{
int n,i,j,count;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[i].id,&stu[i].china,&stu[i].math);
stu[i].total=stu[i].china+stu[i].math;
}
for(i=0;i<3;i++)
{
temp=stu[i];
count=i;
for(j=i+1;j<n;j++)
{
if(stu[j].total>temp.total)
{
temp=stu[j];
count=j;
}
}
stu[count]=stu[i];
stu[i]=temp;
}
for(i=0;i<3;i++)
printf("%d %d\n",stu[i].id,stu[i].total);
return 0;
} | 14 |
6,828 | 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 |
6,829 | 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 |
6,830 | /*
* statistics of scores.cpp
*
* Created on: 2011-12-11
* Author: Administrator
*/
struct stu
{
int Num;
int scoreC;
int scoreM;
int all;
};
struct stu stu[100005];
void fsort(int first,int last)
{
int chosen1,chosen2,p,q;
if(first>=last){return;}
chosen1=stu[first].all;
chosen2=stu[first].Num;
p=first;q=last;
while(p<q)
{
while((p<q)&&(stu[q].all>=chosen1)){q--;}
if(p<q){stu[p].all=stu[q].all;stu[p].Num=stu[q].Num;p++;}
while((p<q)&&(stu[p].all<chosen1)){p++;}
if(p<q){stu[q].all=stu[p].all;stu[q].Num=stu[p].Num;q--;}
}
stu[p].all=chosen1;stu[p].Num=chosen2;
fsort(first,p-1);
fsort(p+1,last);
}
int main()
{
int m,i;//????
cin>>m;
for(i=1;i<=m;i++)//????
{
cin>>stu[i].Num>>stu[i].scoreC>>stu[i].scoreM;
stu[i].all=stu[i].scoreC+stu[i].scoreM;
}
fsort(1,m);
cout<<stu[m].Num<<" "<<stu[m].all<<endl;//?????
cout<<stu[m-1].Num<<" "<<stu[m-1].all<<endl;
cout<<stu[m-2].Num<<" "<<stu[m-2].all<<endl;
return 0;
}
| 14 |
6,831 |
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 |
6,832 | struct student
{
int num;
int chn;
int math;
int sum;
};
int main()
{
int n;
int i, j, e;
int x;
struct student a[100000];
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%d %d %d", &a[i].num, &a[i].chn, &a[i].math);
a[i].sum=a[i].chn+a[i].math;
}
for(i=1; i<=3; i++)
{
for(j=n-i-1; j>=0; j--)
{
if(a[j].sum<a[j+1].sum)
{
x=a[j+1].sum;
a[j+1].sum=a[j].sum;
a[j].sum=x;
e=a[j+1].num;
a[j+1].num=a[j].num;
a[j].num=e;
}
}
}
for(i=0; i<=2; i++)
{
printf("%d %d\n", a[i].num, a[i].sum);
}
return 0;
}
| 14 |
6,833 | struct stu{
int ID;
int yuwen;
int shuxue;
int sum;
struct stu *next;};
struct stu *creat(long n)
{long i;
struct stu *p,*q,*head;
p=(struct stu *)malloc(LEN);
head=q=p;
scanf("%d %d %d",&p->ID,&p->yuwen,&p->shuxue),p->sum=p->shuxue+p->yuwen;
for(i=1;i<n;i++)
{ p=(struct stu *)malloc(LEN);
scanf("%d %d %d",&p->ID,&p->yuwen,&p->shuxue),p->sum=p->shuxue+p->yuwen;
q->next=p,q=p;}
p->next=NULL;
return(head);
}
int main()
{
long i,n;
scanf("%ld",&n);
struct stu *h,*p,*q1,*q2,*q3;
h=creat(n);
int m1,m2,m3;
for(p=h,m1=p->sum;p!=NULL;p=p->next)
if(p->sum>m1) m1=p->sum,q1=p;
printf("%d %d",q1->ID,q1->sum);
for(p=h,m2=p->sum;p!=NULL;p=p->next)
if(p->sum>m2&&p!=q1) m2=p->sum,q2=p;
printf("\n%d %d",q2->ID,q2->sum);
for(p=h,m3=p->sum;p!=NULL;p=p->next)
if(p->sum>m3&&p!=q1&&p!=q2) m3=p->sum,q3=p;
printf("\n%d %d",q3->ID,q3->sum);
}
| 14 |
6,834 | struct student
{
int num;
int score1;
int score2;
int sum;
struct student *next;
};
struct student *creat(int m)
{
int i=0;
struct student *head,*p1,*p2;
p1=p2=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->score1,&p1->score2);
p1->sum=(p1->score1)+(p1->score2);
head=NULL;
while(p1->num<m)
{
i++;
if(i==1) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->score1,&p1->score2);
p1->sum=(p1->score1)+(p1->score2);
}
p2->next=NULL;
return(head);
}
void print(struct student *head)
{
struct student *p=head,*q=head;
int a=0,b=0,c=0;
if(head!=NULL)
{do
{
if(a<p->sum)
{a=p->sum;q=p;}
p=p->next;
}while(p!=NULL);
printf("%d %d\n",q->num,q->sum);
q->sum=0;
p=head;q=head;
do
{if(b<p->sum)
{b=p->sum;q=p;}
p=p->next;
}while(p!=NULL);
printf("%d %d\n",q->num,q->sum);
q->sum=0;
p=head;q=head;
do
{if(c<p->sum)
{c=p->sum;q=p;}
p=p->next;
}while(p!=NULL);
printf("%d %d",q->num,q->sum);
}
}
void main()
{
int m;
scanf("%d",&m);
struct student *head,stu;
head=creat(m);
print(head);
}
| 14 |
6,835 |
struct stu
{
int id;
int ch;
int mt;
int total;
};
struct stu stu_1[100000];
struct stu top1={0,0,0,0},top2={0,0,0,0},top3={0,0,0,0};
int main()
{ int n,i;
struct stu tem;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&(stu_1[i].id),&(stu_1[i].ch),&(stu_1[i].mt));
stu_1[i].total=stu_1[i].ch+stu_1[i].mt;
if(stu_1[i].total>top1.total){
top3=top2;top2=top1;top1=stu_1[i];
}
else if(stu_1[i].total>top2.total){
top3=top2;top2=stu_1[i];
}
else if(stu_1[i].total>top3.total){
top3=stu_1[i];
}
else;
}
printf("%d %d\n",top1.id,top1.total);
if((top2.id)!=0)
printf("%d %d\n",top2.id,top2.total);
if((top3.id)!=0)
printf("%d %d\n",top3.id,top3.total);
return 0;
} | 14 |
6,836 |
int main()
{
int id,chinese,math,total;
int n,i,a=0,b=0,c=0,x=0,y=0,z=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&id,&chinese,&math);
total=chinese+math;
if(total>a)
{
c=b;
z=y;
b=a;
y=x;
a=total;
x=id;
}
else if(total<=a&&total>b)
{
c=b;
z=y;
b=total;
y=id;
}
else if(total<=b&&total>c)
{
c=total;
z=id;
}
}
printf("%d %d\n",x,a);
printf("%d %d\n",y,b);
printf("%d %d\n",z,c);
return 0;
} | 14 |
6,837 | void main()
{
int n,i;
int diyi,dier,disan;
diyi=0;
dier=0;
disan=0;
struct student
{
int num;
int yuwen;
int shuxue;
int sum;
}stu[99999];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].yuwen,&stu[i].shuxue);
stu[i].sum=stu[i].yuwen+stu[i].shuxue;
}
for(i=0;i<n;i++)
{
if(stu[i].sum>stu[diyi].sum){diyi=i;}
}
for(i=0;i<n;i++)
{
while(i!=diyi)
{
dier=i;
break;
}
break;
}
for(i=0;i<n;i++)
{
if(i!=diyi)
{
if(stu[i].sum>stu[dier].sum){dier=i;}
}
}
for(i=0;i<n;i++)
{
while(i!=diyi && i!=dier)
{
disan=i;
break;
}
break;
}
for(i=0;i<n;i++)
{
if(i!=diyi && i!=dier)
{
if(stu[i].sum>stu[disan].sum){disan=i;}
}
}
printf("%d %d\n",diyi+1,stu[diyi].sum);
printf("%d %d\n",dier+1,stu[dier].sum);
printf("%d %d\n",disan+1,stu[disan].sum);
}
| 14 |
6,838 | 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 |
6,839 | struct student
{
int num,z;
}a,max1,max2,max3;
void main()
{
int i,n,x,y;
scanf("%d",&n);
max1.z=-1;
max2.z=-1;
max3.z=-1;
for (i=0;i<n;i++)
{
scanf("%d %d %d",&a.num,&x,&y);
a.z=x+y;
if (a.z>max1.z)
{
max3=max2;
max2=max1;
max1=a;
}
else if (a.z>max2.z)
{
max3=max2;
max2=a;
}else if (a.z>max3.z)
{
max3=a;
max3=a;
}
}
printf("%d %d\n%d %d\n%d %d\n",max1.num,max1.z,max2.num,max2.z,max3.num,max3.z);
}
| 14 |
6,840 | int main ( ) {
int N , i ;
cin >> N ;
int Max1 = 0 , Max2 = 0 , Max3 = 0 , Nb[4] ;
struct student {
int Number ;
int Chinese ;
int Math ;
int Total ;
}people[111111];
for ( i = 1 ; i <= N ; i ++ ) {
cin >> people[i].Number >> people[i].Chinese >> people[i].Math ;
people[i].Total = people[i].Chinese + people[i].Math ;
}
for ( i = 1 ; i <= N ; i ++ ) {
if ( Max1 < people[i].Total ){
Nb[1] = i ;
Max1 = people[i].Total ;
}
}
for ( i = 1 ; i <= N ; i ++ ) {
if ( ( Max2 < people[i].Total ) && ( i != Nb[1] ) ){
Nb[2] = i ;
Max2 = people[i].Total ;
}
}
for ( i = 1 ; i <= N ; i ++ ) {
if ( ( Max3 < people[i].Total ) && ( i != Nb[1] ) && ( i != Nb[2] ) ){
Nb[3] = i ;
Max3 = people[i].Total ;
}
}
for ( i = 1 ; i <= 3 ; i ++ ) {
cout << people[Nb[i]].Number << " " << people[Nb[i]].Total ;
if ( i < 3 )
cout << endl ;
}
return 0 ;
} | 14 |
6,841 | main()
{
int n;
int i,j,k,s,p;
struct student
{int id;
int yuwen;
int shuxue;
int zongfen;
};
struct student stu[100000];
struct student temp;
scanf("%d",&n);
for(p=0;p<n;p++)
{
scanf("%d %d %d",&stu[p].id,&stu[p].yuwen,&stu[p].shuxue);
stu[p].zongfen=stu[p].yuwen+stu[p].shuxue;
}
for(j=0;j<3;j++)
{
for(i=0;i<n-1-j;i++)
{
if(stu[i].zongfen>=stu[i+1].zongfen)
{
temp.id=stu[i].id;
temp.yuwen=stu[i].yuwen;
temp.shuxue=stu[i].shuxue;
temp.zongfen=stu[i].zongfen;
stu[i].id=stu[i+1].id;
stu[i].yuwen=stu[i+1].yuwen;
stu[i].shuxue=stu[i+1].shuxue;
stu[i].zongfen=stu[i+1].zongfen;
stu[i+1].id=temp.id;
stu[i+1].yuwen=temp.yuwen;
stu[i+1].shuxue=temp.shuxue;
stu[i+1].zongfen=temp.zongfen;
}
}
}
for(k=n-1;k>n-4;k--)
{
printf("%d %d\n",stu[k].id,stu[k].zongfen);
}
} | 14 |
6,842 |
struct student{
int num;
int chin;
int math;
int sum;
}tem_stu;
int main()
{
int n,i;
scanf("%d",&n);
struct student *stu;
stu=(struct student*)malloc(n*sizeof(struct student));
for(i=0;i<n;i++){
scanf("%d%d%d",&stu[i].num,&stu[i].chin,&stu[i].math);
stu[i].sum=stu[i].chin+stu[i].math;
}
int j;
for(j=1;j<4;j++){
for(i=0;i<n-j;i++){
if(stu[i].sum>=stu[i+1].sum){
tem_stu=stu[i+1];
stu[i+1]=stu[i];
stu[i]=tem_stu;
}
}
}
printf("%d %d\n",stu[n-1].num,stu[n-1].sum);
printf("%d %d\n",stu[n-2].num,stu[n-2].sum);
printf("%d %d\n",stu[n-3].num,stu[n-3].sum);
free(stu);
return 0;
}
| 14 |
6,843 | struct grade
{
int No;
int chinese;
int math;
int sum;
}student[100000],s;
int main()
{
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&student[i].No,&student[i].chinese,&student[i].math);
student[i].sum=student[i].chinese+student[i].math;
}
for(i=0;i<3;i++){
for(j=i+1;j<n;j++){
if(student[i].sum<student[j].sum){
s=student[i];
student[i]=student[j];
student[j]=s;
}
}
}
for(i=0;i<3;i++){
printf("%d %d\n",student[i].No,student[i].sum);
}
return 0;
} | 14 |
6,844 | struct stu
{
int ID;
int c;
int m;
};
struct stu a[100000];
int main(int argc, char* argv[])
{
int n,i,x,y,z,t,q,w,e;
int b[100000];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d ",&a[i].ID);
scanf("%d ",&a[i].c);
scanf("%d",&a[i].m);
}
for(i=0;i<n;i++)
b[i]=a[i].c+a[i].m;
if(b[0]>b[1]&&b[1]>b[2])
{
x=b[0];
q=1;
y=b[1];
w=1+1;
z=b[2];
e=2+1;
}
else if(b[1]>b[0]&&b[0]>b[2])
{
x=b[1];
y=b[0];
z=b[2];
q=1+1;
w=0+1;
e=2+1;
}
else if(b[2]>b[1]&&b[1]>b[0])
{
x=b[2];
y=b[1];
z=b[0];
q=2+1;
w=1+1;
e=0+1;
}
else if(b[2]>b[0]&&b[0]>b[1])
{
x=b[2];
y=b[0];
z=b[1];
q=2+1;
w=0+1;
e=1+1;
}
else if(b[1]>b[2]&&b[2]>b[0])
{
x=b[1];
y=b[2];
z=b[0];
q=1+1;
w=2+1;
e=0+1;
}else if(b[0]>b[2]&&b[2]>b[1])
{
x=b[0];
y=b[2];
z=b[1];
q=0+1;
w=2+1;
e=1+1;
}
for(i=3;i<n;i++)
{
if(b[i]>x)
{
t=x;
x=b[i];
z=y;
y=t;
e=w;
w=q;
q=i+1;
}
else if(b[i]>y)
{
z=y;
y=b[i];
e=w;
w=i+1;
}
else if(b[i]>z)
{
z=b[i];
e=i+1;
}
}
printf("%d %d\n",q,x);
printf("%d %d\n",w,y);
printf("%d %d\n",e,z);
return 0;
}
| 14 |
6,845 | int main()
{
struct student
{
int idnum,yunum,shunum;
}stu[100000];
int n,i,max=0,ndmax=0,rdmax=0,l=0;
scanf("%d",&n);
int chengji[100000]={0};
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].idnum,&stu[i].yunum,&stu[i].shunum);
chengji[i]=chengji[i]+stu[i].yunum;
chengji[i]=chengji[i]+stu[i].shunum;
}
for(i=0;i<n;i++)
{
if(chengji[i]>max)max=chengji[i];
}
for(i=0;i<n;i++)
{
if(max==(stu[i].yunum+stu[i].shunum))
{
l=l+1;
if(l<=3)printf("%d %d\n",stu[i].idnum,max);
}
}
for(i=0;i<n;i++)
{
if((chengji[i]<max)&&(chengji[i]>ndmax))ndmax=chengji[i];
}
for(i=0;i<n;i++)
{
if(ndmax==(stu[i].yunum+stu[i].shunum))
{
l=l+1;
if(l<=3)printf("%d %d\n",stu[i].idnum,ndmax);
}
}
for(i=0;i<n;i++)
{
if((chengji[i]<ndmax)&&(chengji[i]>rdmax))rdmax=chengji[i];
}
for(i=0;i<n;i++)
{
if(rdmax==(stu[i].yunum+stu[i].shunum))
{
l=l+1;
if(l<=3)printf("%d %d\n",stu[i].idnum,rdmax);
}
}
return 0;
} | 14 |
6,846 | int main()
{
int n,a[100000],b[100000],c[100000],sum[100000],i,t1,t2,t3,s1,s2,s3;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d%d%d",&a[i],&b[i],&c[i]);
sum[i]=b[i]+c[i];}
for(i=0,t1=0,s1=a[0];i<n;i++)
{if(sum[i]>t1)
{t1=sum[i];
s1=a[i];}}
printf("%d %d\n",s1,t1);
for(i=0,t2=0,s2=a[0];i<n;i++)
{if(a[i]==s1)continue;
if(sum[i]>t2)
{t2=sum[i];
s2=a[i];}}
printf("%d %d\n",s2,t2);
for(i=0,t3=0,s3=a[0];i<n;i++)
{if(a[i]==s1||a[i]==s2)continue;
if(sum[i]>t3)
{t3=sum[i];
s3=a[i];}}
printf("%d %d\n",s3,t3);
return 0;
}
| 14 |
6,847 | struct Stu{
int StuNo;
int Chinese;
int math;
int sum;
struct Stu *next;
};
void main()
{
struct Stu *p,*head,*tail;
int n,i,max1,max2,max3,n1,n2,n3;
scanf("%d",&n);
head=tail=NULL;
for(i=1;i<=n;i++)
{
p=(struct Stu*)malloc(len);
scanf("%d%d%d",&p->StuNo,&p->Chinese,&p->math);
if(head==NULL)
head=tail=p;
else
{
tail->next=p;
tail=p;}
p->sum=p->Chinese+p->math;
}
max1=head->sum;n1=1;
for(i=1;i<=n;i++)
{if(i==1) p=head;
else p=p->next;
if((p->sum)>max1) {max1=p->sum;n1=i;}
}
for(i=1;i<=n;i++)
{if(i==1) p=head;
else p=p->next;
if(i==n1) p->sum=0;}
max2=head->sum;n2=1;
for(i=1;i<=n;i++)
{if(i==1) p=head;
else p=p->next;
if((p->sum)>max2) {max2=p->sum;n2=i;}
}
for(i=1;i<=n;i++)
{if(i==1) p=head;
else p=p->next;
if(i==n2) p->sum=0;}
max3=head->sum;n3=1;
for(i=1;i<=n;i++)
{if(i==1) p=head;
else p=p->next;
if((p->sum)>max3) {max3=p->sum;n3=i;}
}
printf("%d %d\n%d %d\n%d %d\n",n1,max1,n2,max2,n3,max3);
}
| 14 |
6,848 | void main()
{
int n,i,j,k,max=0,smax=0,tmax=0,id[3]={0},a,b,c;
struct student
{
int No;
int yuwen;
int math;
}stu[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&stu[i].No);
scanf("%d",&stu[i].yuwen);
scanf("%d",&stu[i].math);
}
for(i=0;i<n;i++)
{
if(max<stu[i].yuwen+stu[i].math)
{
max=stu[i].yuwen+stu[i].math;
id[0]=stu[i].No;}
}
for(i=0;i<n;i++)
{
if(smax<stu[i].yuwen+stu[i].math&&i!=id[0]-1)
{smax=stu[i].yuwen+stu[i].math;
id[1]=stu[i].No;}
}
for(i=0;i<n;i++)
{
if(tmax<stu[i].yuwen+stu[i].math&&i!=id[0]-1&&i!=id[1]-1)
{tmax=stu[i].yuwen+stu[i].math;
id[2]=stu[i].No;}
}
a=id[0];
b=id[1];
c=id[2];
printf("%d %d\n",a,max);
printf("%d %d\n",b,smax);
printf("%d %d\n",c,tmax);
} | 14 |
6,849 | main()
{
struct student{
int id;
float yuwen,shuxue,sum;
}stu[100000],t;
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d %f %f",&stu[i].id,&stu[i].yuwen,&stu[i].shuxue);
stu[i].sum=stu[i].yuwen+stu[i].shuxue;}
for(i=0;i<3;i++)
for(j=n-1;j>i;j--)
if(stu[j].sum>stu[j-1].sum)
{
t=stu[j];
stu[j]=stu[j-1];
stu[j-1]=t;
}
for(i=0;i<3;i++)
printf("%d %g\n",stu[i].id,stu[i].sum);
} | 14 |
6,850 | int first[3],firsti[3];
struct stu
{
int num;
int chinese;
int math;
int sum;
struct stu *next;
} *p1,*p2;
struct stu *creat(int n)
{ struct stu *head=NULL;
p1=p2=(struct stu*)malloc(sizeof(struct stu));
while (n--)
{ scanf("%d %d %d",&p1->num,&p1->chinese,&p1->math);
if(head==NULL) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct stu*)malloc(sizeof(struct stu));
}
p2->next=NULL;
return(head);
}
struct stu *sum(struct stu *head,int n)
{ p1=head;
while(n--)
{p1->sum=p1->chinese+p1->math;
p1=p1->next;
}
return(head);
}
int main()
{int n,i,check=0;
struct stu *head,*f1,*f2,*f3;
f1=(struct stu*)malloc(sizeof(struct stu));
scanf("%d",&n);
head=creat(n);
head=sum(head,n);
p1=head; if(n==1) {printf("%d %d\n",p1->num,p1->sum);return 0;}
for(i=0,f1=head;i<n;i++,p1=p1->next)
if(f1->sum<p1->sum) f1=p1;
p1=head;
for(i=0;i<n;i++)
{p2=p1;p1=p1->next;
if(head==f1) {head=p1;break;}
else if(p1==f1)
{
p2->next=p1->next;
}
}
p1=head;
for(i=0,f2=head;i<n-1;i++,p1=p1->next)
if(f2->sum<p1->sum) f2=p1;
if(n==2) {printf("%d %d\n",f1->num,f1->sum);
printf("%d %d\n",f2->num,f2->sum);
return 0;
}
p1=head;
for(i=0;i<n-1;i++)
{p2=p1;p1=p1->next;
if(head==f2) {head=p1;break;}
else if(p1==f2)
{
p2->next=p1->next;
}
}
p1=head;
for(i=0,f3=head;i<n-2;i++,p1=p1->next)
if(f3->sum<p1->sum) f3=p1;
printf("%d %d\n",f1->num,f1->sum);
printf("%d %d\n",f2->num,f2->sum);
printf("%d %d\n",f3->num,f3->sum);
return 0;
} | 14 |
6,851 | 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 |
6,852 | int main()
{
struct student
{
int num;
int math;
int chinese;
int sum;
}a[100000];
int n,i,j,temp;
char c[10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&a[i].num,&a[i].math,&a[i].chinese);
a[i].sum=a[i].math+a[i].chinese;
}
for(i=0;i<3;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i].sum<a[j].sum)
{
temp=a[i].sum,a[i].sum=a[j].sum,a[j].sum=temp;
temp=a[i].num,a[i].num=a[j].num,a[j].num=temp;
}
}
printf("%d %d\n",a[i].num,a[i].sum);
}
return 0;
} | 14 |
6,853 | struct s{
int num;
int x;
int y;
int z;
}s[100000],s1,s2,s3,A;
int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%d %d %d",&s[i].num,&s[i].x,&s[i].y);
s[i].z=s[i].x+s[i].y;
}
if(s[0].z>=s[1].z)
{
s1=s[0];
s2=s[1];
}
else
{
s1=s[1];
s2=s[0];
}
if(s[2].z>=s1.z)
{
A=s1;
s1=s[2];
s3=s2;
s2=A;
}
else if(s[2].z<s2.z)
{
s3=s[2];
}
else if(s[2].z>=s2.z&&s[2].z<s1.z)
{
s3=s2;
s2=s[2];
}
for(i=3;i<n;i++)
{
if(s[i].z>s1.z)
{
s3=s2;
s2=s1;
s1=s[i];
}
else if(s[i].z<s3.z)
{
;
}
else if(s[i].z<s1.z&&s[i].z>s3.z)
{
if(s[i].z>s2.z)
{
s3=s2;
s2=s[i];
}
else
{
s3=s[i];
}
}
else if (s[i].z==s1.z)
{
s3=s2;
s2=s[i];
}
else if(s[i].z==s2.z)
{
s3=s[i];
}
}
printf("%d %d\n",s1.num,s1.z);
printf("%d %d\n",s2.num,s2.z);
printf("%d %d\n",s3.num,s3.z);
return 0;
} | 14 |
6,854 | struct student
{int id;
int chin;
int math;
int sum;
}stu[100000];
int main()
{
int n,i,j,tem,temp;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&stu[i].id,&stu[i].chin,&stu[i].math);
stu[i].sum=stu[i].chin+stu[i].math;
}
int max[3]={0};
for(i=1;i<n;i++){
if(stu[i].sum>stu[max[0]].sum){
tem=max[0];temp=max[1];
max[0]=i;max[1]=tem;max[2]=temp;
}else{
if(stu[i].sum>stu[max[1]].sum){
tem=max[1];
max[1]=i;max[2]=tem;
}else{
if(stu[i].sum>stu[max[2]].sum)
max[2]=i;}
}
}
for(i=0;i<3;i++)
printf("%d %d\n",stu[max[i]].id,stu[max[i]].sum);
return 0;
} | 14 |
6,855 | int main()
{
int n,i,max1=0,max2=0,max3=0,t1=0,t2=0,t3=0;
int ID[100000],y[100000],m[100000],s[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d",&ID[i],&y[i],&m[i]);
for(i=0;i<n;i++)
s[i]=y[i]+m[i];
for(i=0;i<n;i++)
{
if(max1<s[i])
{
max1=s[i];
t1=i;
}
}
s[t1]=0;
for(i=0;i<n;i++)
{
if(max2<s[i])
{
max2=s[i];
t2=i;
}
}
s[t2]=0;
for(i=0;i<n;i++)
{
if(max3<s[i])
{
max3=s[i];
t3=i;
}
}
printf("%d %d\n",ID[t1],max1);
printf("%d %d\n",ID[t2],max2);
printf("%d %d\n",ID[t3],max3);
getchar();
getchar();
getchar();
return 0;
}
| 14 |
6,856 | int main()
{
int n;
scanf("%d",&n);
struct student
{
int num;
int yu;
int shu;
}a[100000];
int d[100000];
int i=0;;
for(i=0;i<n;i++)
{
scanf("%d %d %d",&a[i].num,&a[i].yu,&a[i].shu);
d[i]=a[i].yu+a[i].shu;
}
int q,w,e,h;
q=0;
w=0;e=0;
for(i=0;i<n;i++)
{
if(d[q]<d[i])
{
q=i;
}
}
for(i=0;i<n;i++)
{
if(d[q]>=d[i]&&i!=q&&d[w]<d[i])
{
w=i;
}
}
for(i=0;i<n;i++)
{
if(d[w]>=d[i]&&i!=w&&i!=q&&d[e]<d[i])
{
e=i;
}
}
printf("%d %d\n",a[q].num,d[q]);
printf("%d %d\n",a[w].num,d[w]);
printf("%d %d\n",a[e].num,d[e]);
return 0;
} | 14 |
6,857 | struct stu
{int num;
int score1;
int score2;
}stu[100000];
void main()
{
int i,j,n,a[100000],max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[i].num,&stu[i].score1,&stu[i].score2);
a[i]=stu[i].score1+stu[i].score2;
}
for(j=0;j<3;j++)
{
max=0;
for(i=0;i<n;i++)
max=(max>=a[i])?max:a[i];
for(i=0;i<n;i++)
if(a[i]==max)
{printf("%d %d\n",stu[i].num,a[i]);
a[i]=0;
break;
}
}
} | 14 |
6,858 | struct student
{
int num;
int chinese;
int math;
struct student * next;
};
int m;
struct student * creat(int n)
{
struct student * head;
struct student * p1,*p2;
m=0;
p1=p2=(struct student*)malloc(sizeof(struct student));
scanf("%d%d%d",&p1->num,&p1->chinese,&p1->math);
head=NULL;
while(n--)
{
m=m+1;
if(m==1)
head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student *)malloc(sizeof(struct student));
scanf("%d%d%d",&p1->num,&p1->chinese,&p1->math);
}
p2->next=NULL;
return(head);
}
struct student * del(struct student * head,int num)
{
struct student *p1,*p2;
p1=head;
while(num!=p1->num&&p1->next!=NULL)
{
p2=p1;
p1=p1->next;
}
if(num==p1->num)
{
if(p1==head)
head=p1->next;
else
p2->next=p1->next;
m=m-1;
}
return(head);
}
int main()
{
int max=0;
int n,j;
scanf("%d",&n);
struct student *head,*p1,*p2;
head=creat(n);
for(j=0;j<3;j++)
{
p1=head;
p2=head;
max=0;
while(p1->next!=NULL)
{
if((p1->chinese+p1->math)>max)
max=p1->chinese+p1->math,p2=p1;
p1=p1->next;
}
printf("%d %d\n",p2->num,(p2->chinese+p2->math));
head=del(head,p2->num);
}
} | 14 |
6,859 | int main()
{
int n,i,p,q,c,d;
int a[100000];
scanf("%d",&n);
struct student
{ int num;
int score1;
int score2;
}stu[100000];
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].score1,&stu[i].score2);
}
for(i=0;i<n;i++)
{
a[i]=stu[i].score1+stu[i].score2;
}
int max1,max2,max3;
int num1,num2,num3;
if(a[0]>=a[1])
{
max1= a[0];
num1=0;
if(a[0]<a[2])
{
max1=a[2];
num1=2;
max2=a[0];
num2=0;
max3=a[1];
num3=1;
}
else
{
if(a[1]>=a[2])
{
max2=a[1];
num2=1;
max3=a[2];
num3=2;
}
else
{
max2=a[2];
num2=2;
max3=a[1];
num3=1;
}
}
}
else
{
max1= a[1];
num1=1;
if(a[1]<a[2])
{
max1=a[2];
num1=2;
max2=a[1];
num2=1;
max3=a[0];
num3=0;
}
else
{
if(a[0]>=a[2])
{
max2=a[0];
num2=0;
max3=a[2];
num3=2;
}
else
{
max2=a[2];
num2=2;
max3=a[0];
num3=0;
}
}
}
for(i=3;i<n;i++)
{
if(a[i]>max1)
{
p=max1;q=max2;c=num1;d=num2;
max1=a[i];max2=p;max3=q;
num1=i;num2=c;num3=d;
}
else
{if(a[i]>max2&&a[i]<=max1)
{
p=max2;c=num2;
max2=a[i];max3=p;
num2=i;num3=c;
}
else
{
if(a[i]>max3&&a[i]<=max2)
{
max3=a[i];num3=i;
}
}
}
}
printf("%d %d\n%d %d\n%d %d\n",num1+1,a[num1],num2+1,a[num2],num3+1,a[num3]);
getchar();
getchar();
getchar();
} | 14 |
6,860 | struct stu
{
int num;
int m;
int c;
int sum;
};
int main()
{
long int n;
int a=0,b=0,c=0,x=0,y=0,z=0;
struct stu student[65535];
scanf("%d",&n);
for (int i=0;i<n;i++)
{
scanf("%d %d %d",&student[i].num,&student[i].c,&student[i].m);
student[i].sum=student[i].m+student[i].c;
}
for (int i=0;i<n;i++)
{
if(student[i].sum>a)
{
c=b;
z=y;
b=a;
y=x;
a=student[i].sum;
x=student[i].num;
continue;
}
if(student[i].sum>b)
{
c=b;
z=y;
b=student[i].sum;
y=student[i].num;
continue;
}
if (student[i].sum>c)
{
c=student[i].sum;
z=student[i].num;
}
}
printf("%d %d\n%d %d\n%d %d\n",x,a,y,b,z,c);
getchar();
getchar();
return 0;
} | 14 |
6,861 | struct Student
{
long id;
int chn;
int mth;
int total;
struct Student *next;
};
struct Student * insert(struct Student *head,struct Student *stu)
{
int j=0;
struct Student *p0,*p1,*p2;
p1=head;
p0=stu;
if(head==NULL)
{head=p0;p0->next=NULL;}
else
{
while((p0->total<=p1->total)&&(p1->next!=NULL)&&j<4)
{p2=p1;p1=p1->next;j++;}
if(p0->total>p1->total)
{
if(head==p1) head=p0;
else p2->next=p0;
p0->next=p1;
}
else
{p1->next=p0;p0->next=NULL;}
}
return(head);
}
void main()
{
struct Student *p1,*head,*stu;
long int i,n;
scanf("%ld",&n);
p1=head=(struct Student*)malloc(sizeof(struct Student));
scanf("%d %d %d",&head->id,&head->chn,&head->mth);
head->total=head->chn + head->mth;
head->next=NULL;
for(i=1;i<n;i++)
{
stu=(struct Student*)malloc(sizeof(struct Student));
scanf("%d %d %d",&stu->id,&stu->chn,&stu->mth);
stu->total=stu->chn + stu->mth;
head=insert(head,stu);
}
p1=head;
for(i=0;i<3;i++)
{printf("%d %d\n",p1->id,p1->total);p1=p1->next;}
} | 14 |
6,862 | int main()
{
struct
{
int number;
float score1;
float score2;
float score3;
}stu[100000],temp;
int n,i,j;
cin>>n;
for(i=0;i<=n-1;i++)
{
cin>>stu[i].number>>stu[i].score1>>stu[i].score2;
stu[i].score3=stu[i].score2+stu[i].score1;
}
for(i=n-1;i>=n-3;i--)
for(j=n-1;j>=n-i;j--)
if(stu[j-1].score3<stu[j].score3)
{
temp=stu[j];
stu[j]=stu[j-1];
stu[j-1]=temp;
}
cout<<stu[0].number<<" "<<stu[0].score3<<endl;
cout<<stu[1].number<<" "<<stu[1].score3<<endl;
cout<<stu[2].number<<" "<<stu[2].score3;
return 0;
}
| 14 |
6,863 |
struct student{
int num;
int chinese;
int math;
};
void main()
{
int n,s[100000];
scanf("%d",&n);
int i,j,max=0,t;
struct student a[100000];
for(i=0;i<n;i++){
scanf("%d%d%d",&a[i].num,&a[i].chinese,&a[i].math);
s[i]=a[i].chinese+a[i].math;
}
for(i=0;i<3;i++){
for(j=0;j<n;j++){
if(s[j]>max){
max=s[j];t=j;}}
printf("%d %d\n",a[t].num,max);
max=0;s[t]=0;}
}
| 14 |
6,864 | struct student{
int id;
int chi;
int math;
int total;
struct student *next;
};
int student_num;
struct student *creat()
{
struct student *p1,*p2,*head;
int n=0;
scanf("%d",&student_num);
p1=p2=(struct student*)malloc(sizeof (struct student));
while(n<student_num)
{
if (n==0) head=p1;
if (n==student_num-1) p1->next=NULL;
scanf("%d %d %d",&p1->id,&p1->chi,&p1->math);
p1->total=p1->chi+p1->math;
p2=p1;
p1=(struct student*)malloc(sizeof (struct student));
p2->next=p1;
n++;
}
return head;
}
void main()
{
struct student *head,*p;
int i,n=0,first,second,third,firstid,secondid,thirdid;
head=creat();
first=0;
second=0;
third=0;
p=head;
for(i=1;i<=student_num;i++){
if (p->total>first){
third=second;second=first;first=p->total;
thirdid=secondid;secondid=firstid;firstid=p->id;
}
else if (p->total<=first&&p->total>second){
third=second;second=p->total;
thirdid=secondid;secondid=p->id;
}
else if (p->total<=second&&p->total>third){
third=p->total;
thirdid=p->id;
}
p=p->next;
}
printf("%d %d\n%d %d\n%d %d\n",firstid,first,secondid,second,thirdid,third);
} | 14 |
6,865 | struct Student
{
int num;
int chinese;
int math;
}sdu[99999];
int main()
{
int N,i,j,s,t,m;
scanf("%d",&N);
for(i=0;i<N;i++)
scanf("%d%d%d",&sdu[i].num,&sdu[i].chinese,&sdu[i].math);
for(j=0;j<3;j++){
for(i=0;i<N-j-1;i++)
if((sdu[i].chinese+sdu[i].math)>=(sdu[i+1].chinese+sdu[i+1].math)){
s=sdu[i].num;t=sdu[i].chinese;m=sdu[i].math;
sdu[i].num=sdu[i+1].num;sdu[i].chinese=sdu[i+1].chinese;sdu[i].math=sdu[i+1].math;
sdu[i+1].num=s;sdu[i+1].chinese=t;sdu[i+1].math=m;
}
}
for(i=0;i<3;i++)
printf("%d %d\n",sdu[N-1-i].num,sdu[N-1-i].chinese+sdu[N-1-i].math);
} | 14 |
6,866 | struct student
{
int num;
int chinese;
int math;
int sum;
}work[100001];
void qsort(int left,int right)
{
if (left>=right) return;
int pindex=left,rindex=right;
work[0]=work[left];
while (pindex<rindex)
{
while ((pindex<rindex)&&(work[rindex].sum>=work[0].sum))
rindex--;
if (pindex<rindex){work[pindex]=work[rindex];pindex++;}
while ((pindex<rindex)&&(work[pindex].sum<work[0].sum))
pindex++;
if (pindex<rindex){work[rindex]=work[pindex];rindex--;}
}
work[pindex]=work[0];
qsort(left,pindex-1);
qsort(pindex+1,right);
}
int main()
{
int n,i;
cin>>n;
for (i=1;i<=n;i++)
{
cin>>work[i].num>>work[i].chinese>>work[i].math;
work[i].sum=work[i].chinese+work[i].math;
}
qsort(1,n);
for (i=0;i<=2;i++)
cout<<work[n-i].num<<" "<<work[n-i].sum<<endl;
return 0;
} | 14 |
6,867 |
struct person
{
char num[6];
int Chinese;
int math;
int total;
}stu[100000];
int main()
{
int n, i, max, j, k, temp = 0,tnum = 0;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> stu[i].num;
cin >> stu[i].Chinese;
cin >> stu[i].math;
stu[i].total = stu[i].math + stu[i].Chinese;
}
for (j = 0; j < 3; j++)
{
max = 0;
for (i = 0; i < n; i++)
{
if (stu[i].total > max)
{
max = stu[i].total;
k = i;
}
}
cout << stu[k].num << " " << stu[k].total << endl;
stu[k].total = 0;
}
return 0;
} | 14 |
6,868 | 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 |
6,869 | struct student
{
int number;
int math;
int chin;
int sum;
}st[100000],t;
void main()
{
int i,j;
int n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&st[i].number,&st[i].math,&st[i].chin);
st[i].sum=st[i].math+st[i].chin;
}
for(i=0;i<3;i++)
for(j=n;j>=1;j--)
if(st[j].sum>st[j-1].sum)
{
t=st[j-1];
st[j-1]=st[j];
st[j]=t;
}
for(i=0;i<3;i++)
printf("%d %d\n",st[i].number,st[i].sum);
}
| 14 |
6,870 | struct student
{
long num;
int chi;
int math;
int add;
};
struct student stu[100000];
void main()
{
int m,k,n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%ld %d %d",&stu[i].num,&stu[i].chi,&stu[i].math);
stu[i].add=stu[i].chi+stu[i].math;
}
for(j=0;j<3;j++)
for(i=n-1;i>0;i--)
{
if(stu[i].add>stu[i-1].add)
{
k=stu[i].add;stu[i].add=stu[i-1].add;stu[i-1].add=k;
m=stu[i].num;stu[i].num=stu[i-1].num;stu[i-1].num=m;
}
}
for(i=0;i<3;i++)
printf("%ld %d\n",stu[i].num,stu[i].add);
}
| 14 |
6,871 | void main()
{
struct student
{
long num;
int chinese;
int math;
};
struct student stu[100001];
int i,t,h,l=0;
long n;
int a[100001];
scanf("%ld",&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++)
a[i]=stu[i].chinese+stu[i].math;
leap:
t=a[0];
h=0;
for(i=1;i<n;i++)
{
if(a[i]>t)
{
t=a[i];
h=i;
}
}
printf("%ld %d\n",stu[h].num,a[h]);
l++;
a[h]=0;
if(l<3)
goto leap;
} | 14 |
6,872 | struct student
{
int num;
int chinese;
int maths;
int sum;
struct student *next;
};
int m,max[3]={0},t[3]={0};
struct student *head;
struct student *p1,*p2;
struct student *creat(int n)
{
m=0;
p1=p2=(struct student*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->chinese,&p1->maths);
p1->sum=p1->chinese+p1->maths;
head=NULL;
while(m<n-1)
{
m=m+1;
if(m==1)
head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->chinese,&p1->maths);
p1->sum=p1->chinese+p1->maths;
}
p2->next=p1;
p2=p1;
p2->next=NULL;
return(head);
}
void main()
{
int n;
scanf("%d",&n);
creat(n);
struct student *p1;
p1=head;
do
{
if(p1->sum>max[0])
{
max[0]=p1->sum;
t[0]=p1->num;
}
p1=p1->next;
} while(p1!=NULL);
printf("%d %d\n",t[0],max[0]);
p1=head;
do
{
if(p1->sum>max[1]&&p1->num!=t[0])
{
max[1]=p1->sum;
t[1]=p1->num;
}
p1=p1->next;
} while(p1!=NULL);
printf("%d %d\n",t[1],max[1]);
p1=head;
do
{
if(p1->sum>max[2]&&p1->num!=t[0]&&p1->num!=t[1])
{
max[2]=p1->sum;
t[2]=p1->num;
}
p1=p1->next;
} while(p1!=NULL);
printf("%d %d\n",t[2],max[2]);
}
| 14 |
6,873 | struct point{
int id,a,b,c;
}s[100000],tmp;
int main(int argc, char *argv[])
{
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&s[i].id,&s[i].a,&s[i].b);
s[i].c=s[i].a+s[i].b;
}
for(i=1;i<n;i++)
{
if(s[i].c>s[0].c)
{
tmp=s[0];
s[0]=s[i];
s[i]=tmp;
}
}
for(i=2;i<n;i++)
{
if(s[i].c>s[1].c)
{
tmp=s[1];
s[1]=s[i];
s[i]=tmp;
}
}
for(i=3;i<n;i++)
{
if(s[i].c>s[2].c)
{
tmp=s[2];
s[2]=s[i];
s[i]=tmp;
}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",s[i].id,s[i].c);
}
return 0;
}
| 14 |
6,874 | int main()
{
struct Stu
{
int num;
int sco[2];
int sum;
};
struct Stu stu[5];
struct Stu temp;
int i,j,n,m,k;
scanf("%d",&n);
if(n>=3)
{
for(i=0;i<3;i++)
{
scanf("%d%d%d",&stu[i].num,&stu[i].sco[0],&stu[i].sco[1]);
stu[i].sum=stu[i].sco[0]+stu[i].sco[1];
}
for(k=1;k<=n-3;k++)
{
scanf("%d%d%d",&stu[3].num,&stu[3].sco[0],&stu[3].sco[1]);
stu[3].sum=stu[3].sco[0]+stu[3].sco[1];
m=0;
for(j=1;j<=2;j++)
{
if(stu[m].sum>stu[j].sum||(stu[m].sum==stu[j].sum&&stu[m].num<stu[j].num))
m=j;
}
if(stu[3].sum>stu[m].sum)
stu[m]=stu[3];
}
}
for(i=0;i<2;i++)
for(j=i+1;j<3;j++)
if(stu[i].num>stu[j].num)
{
temp=stu[i];
stu[i]=stu[j];
stu[j]=temp;
}
for(i=0;i<2;i++)
for(j=i+1;j<3;j++)
if(stu[i].sum<stu[j].sum)
{
temp=stu[i];
stu[i]=stu[j];
stu[j]=temp;
}
for(i=0;i<3;i++)
printf("%d %d\n",stu[i].num,stu[i].sum);
return 0;
}
| 14 |
6,875 | int main()
{
int a[100000][3],i,j,n,b[100000][2],t,m,k;
scanf("%d",&n);
for(i=0;i<n;i++)
for(j=0;j<3;j++)
scanf("%d",&a[i][j]);
for(i=0;i<n;i++)
{
b[i][0]=a[i][0];
b[i][1]=a[i][1]+a[i][2];
}
for(i=0;i<3;i++)
{
for(k=i+1;k<n;k++)
{
if(b[i][1]<b[k][1])
{
t=b[k][1];
b[k][1]=b[i][1];
b[i][1]=t;
m=b[k][0];
b[k][0]=b[i][0];
b[i][0]=m;
}
}
}
for(i=0;i<3;i++)
printf("%d %d\n",b[i][0],b[i][1]);
return 0;
}
| 14 |
6,876 | 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 |
6,877 | struct student
{
int stuID;
int yuwen;
int shuxue;
int zongfen;
}stu[100000];
int main()
{
int i,n,j,x,str;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].stuID,&stu[i].yuwen,&stu[i].shuxue);
stu[i].zongfen=stu[i].yuwen+stu[i].shuxue;
}
for(i=0;i<3;i++)
{
for(j=0;j<n-1;j++)
{
if(stu[j].zongfen>stu[j+1].zongfen||((stu[j].zongfen==stu[j+1].zongfen)&&(stu[j].stuID<stu[j+1].stuID)))
{
x=stu[j].zongfen;
stu[j].zongfen=stu[j+1].zongfen;
stu[j+1].zongfen=x;
str=stu[j].stuID;
stu[j].stuID=stu[j+1].stuID;
stu[j+1].stuID=str;
}
}
printf("%d %d\n",stu[n-1-i].stuID,stu[n-1-i].zongfen);
}
return 0;
}
| 14 |
6,878 |
struct student
{
int num,cn,math,sum,rank;
struct student *next;
};
int n;
struct student * creat(void)
{
int i=1;
struct student *head;
struct student *p1,*p2;
p1=p2=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->cn,&p1->math);
head=p1;
do
{
p2=p1;
if(i==n)
break;
p1=(struct student *) malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->cn,&p1->math);
p2->next=p1;
i++;
}while(1);
p2->next=0;
return(head);
}
void count(struct student *head)
{
int max=0;
struct student *p1;
n=1;
p1=head;
do
{
p1->sum=p1->cn+p1->math;
if(max<p1->sum)
max=p1->sum;
if(p1->next==0)
break;
p1=p1->next;
}while(1);
p1=head;
do
{
if(p1->sum==max)
{
p1->rank=n;
n++;
}
if(n>3)break;
if(p1->next==0)
{
p1=head;
max--;
}
else
p1=p1->next;
}while(1);
}
void print(struct student *head)
{
struct student *p1;
n=1;
p1=head;
do
{
if (p1->rank==n)
{
printf("%d %d\n",p1->num,p1->sum);
n++;
}
if(n>3)
break;
if(p1->next==0)
p1=head;
else p1=p1->next;
}while(1);
}
void main()
{
struct student *head;
scanf("%d",&n);
head=creat();
count(head);
print(head);
}
| 14 |
6,879 | int main(int argc, char* argv[])
{
int i;
long n;
int sum[100000];
int max=0,second=0,third=0;
int a=0,b=0,c=0;
scanf("%d",&n);
struct student
{
int id;
int chi;
int math;
};
struct student wangchong[100000];
for (i=0;i<n;i++)
{
scanf("%d%d%d",&wangchong[i].id,&wangchong[i].chi,&wangchong[i].math);
sum[i]=wangchong[i].chi+wangchong[i].math;
if (sum[i]>third)
{
if (sum[i]<=second)
{
third=sum[i];
c=i+1;
}
else
{
if (sum[i]<=max)
{
third=second;
second=sum[i];
c=b;
b=i+1;
}
else
{
third=second;
c=b;
second=max;
b=a;
max=sum[i];
a=i+1;
}
}
}
}
printf("%d %d\n%d %d\n%d %d\n",a,max,b,second,c,third);
return 0;
} | 14 |
6,880 | int main()
{
struct score
{
int ID;
int c;
int m;
};
int n,k,t,r;
int j;
scanf("%d",&n);
int sum[100000];
struct score s[100000];
for(int i=1;i<=n;i++)
{
scanf("%d %d %d",&s[i].ID,&s[i].c,&s[i].m);
sum[i]=s[i].c+s[i].m;
}
for(j=1;j<=3;j++)
{
for(k=j;k<=n;k++)
{
if(sum[k]>sum[j])
{ t=sum[j];
sum[j]=sum[k];
sum[k]=t;
r=s[j].ID;
s[j].ID=s[k].ID;
s[k].ID=r;
}
}
}
for(int u=1;u<=3;u++)
{
printf("%d %d\n",s[u].ID,sum[u]);
}
getchar();
getchar();
} | 14 |
6,881 | struct student{
int xuehao;
int yuwen;
int shuxue;
int mark;
struct student *next;
};
int n;
struct student *creat(int max)
{
struct student *head;
struct student *p1,*p2;
n=0;
p1=p2=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->xuehao,&p1->yuwen,&p1->shuxue);
head=p1;
while(n<max-1)
{
n++;
if(n!=1)p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->xuehao,&p1->yuwen,&p1->shuxue);
}
p2->next=p1;
p1->next=0;
return head;
}
void main()
{
int max,i;
struct student *table;
scanf("%d",&max);
table=creat(max);
for(i=0;i<3;i++)
{
int mmax=0;
int mark=0;
struct student *p;
p=table;
do{
if(p->shuxue+p->yuwen>mmax&&p->mark!=-1){mark++;p->mark=mark;mmax=p->shuxue+p->yuwen;}
p=p->next;
}while(p!=0);
p=table;
do{
if(p->mark==mark){
printf("%d %d\n",p->xuehao,p->shuxue+p->yuwen);
p->mark=-1;}
p=p->next;
}while(p!=0);
}
}
| 14 |
6,882 | struct stu
{
char num[15];
int chi;
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->chi,&p->math);
p->sum=p->chi+p->math;
for (i=0;;i++)
{
if (i==0) {head=p;head->next=NULL;}
else if (i<3)
{
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->chi,&p->math);
p->sum=p->chi+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,883 | int main()
{
int n,i,j,p,q,t;
int a[100000][3];
scanf("%d",&n);
for(i=0;i<n;i++){
for(j=0;j<3;j++)
scanf("%d",&a[i][j]);
a[i][1]=a[i][1]+a[i][2];
}
for(p=0;p<3;p++){
for(q=n-2;q>=0;q--){
if(a[q][1]<a[q+1][1]){
for(i=0;i<2;i++){
t=a[q][i];
a[q][i]=a[q+1][i];
a[q+1][i]=t;
}
}
}
}
for(i=0;i<3;i++){
printf("%d %d\n",a[i][0],a[i][1]);
}
return 0;
}
| 14 |
6,884 | struct student
{
int num;
double chi;
double math;
double total;
};
int main()
{
struct student stu[100000];
struct student temp;
int n,i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%lf%lf",&stu[i].num,&stu[i].chi,&stu[i].math);
stu[i].total=stu[i].chi+stu[i].math;
}
for(i=0;i<3;i++)
{
k=i;
for(j=i;j<n;j++)
{
if(stu[k].total<stu[j].total)
{
k=j;
}
}
if(k!=i)
{
temp=stu[i];
stu[i]=stu[k];
stu[k]=temp;
}
}
for(i=0;i<3;i++)
{
printf("%d %.0lf\n",stu[i].num,stu[i].total);
}
return 0;
}
| 14 |
6,885 |
struct statistics
{
int num;
int chinese;
int math;
int sum;
} form[100000],temp;
int main()
{
int n;
scanf("%d",&n);
int i,j;
for(i=0;i<n;i++)
{
scanf("%d %d %d",&form[i].num,&form[i].chinese,&form[i].math);
form[i].sum=form[i].chinese+form[i].math;
}
for(i=0;i<3&&i<n-1;i++)
{
int k=i;
for(j=i+1;j<n;j++)
{
if(form[j].sum>form[k].sum)
{
k=j;
}
}
if (k!=i)
{
temp=form[i];
form[i]=form[k];
form[k]=temp;
}
}
for(i=0;i<3;i++)
printf("%d %d\n",form[i].num,form[i].sum);
return 0;
} | 14 |
6,886 | void main()
{
int i,j,m,n,a[3][2],k;
struct student
{
int num;
int s1;
int s2;
int l;
}stu[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].s1,&stu[i].s2);
stu[i].l=stu[i].s1+stu[i].s2;
}
for(i=0;i<3;i++)
{
for(m=0,j=0;j<n;j++)
{
if(m<stu[j].l)
{
m=stu[j].l;
k=j;
}
}
a[i][0]=k;
a[i][1]=m;
stu[k].l=0;
}
for(i=0;i<3;i++)
{
printf("%d %d\n",a[i][0]+1,a[i][1]);
}
}
| 14 |
6,887 | 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 |
6,888 |
struct stu{
long int num[100000];
int y[100000];
int m[100000];
};
int main()
{
int n,i,temp=0,sum[100000];
struct stu p;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%ld %d %d",&p.num[i],&p.y[i],&p.m[i]);
sum[i]=p.m[i]+p.y[i];
}
for(i=0;i<n-1;i++){
if(sum[i]>=sum[i+1]){
temp=sum[i+1];
sum[i+1]=sum[i];
sum[i]=temp;
temp=p.num[i+1];
p.num[i+1]=p.num[i];
p.num[i]=temp;
}
}
printf("%ld %d\n",p.num[n-1],sum[n-1]);
for(i=0;i<n-2;i++){
if(sum[i]>=sum[i+1]){
temp=sum[i+1];
sum[i+1]=sum[i];
sum[i]=temp;
temp=p.num[i+1];
p.num[i+1]=p.num[i];
p.num[i]=temp;
}
}
printf("%ld %d\n",p.num[n-2],sum[n-2]);
for(i=0;i<n-3;i++){
if(sum[i]>=sum[i+1]){
temp=sum[i+1];
sum[i+1]=sum[i];
sum[i]=temp;
temp=p.num[i+1];
p.num[i+1]=p.num[i];
p.num[i]=temp;
}
}
printf("%ld %d\n",p.num[n-3],sum[n-3]);
return 0;
}
| 14 |
6,889 | int main()
{
int n,i,k,a[100000][3],c[100000][3];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d%d",&a[i][1],&a[i][2],&a[i][3]);
for(i=n-2;i>=0;i--)
{ if(a[i][2]+a[i][3]<a[i+1][2]+a[i+1][3])
{c[i][1]=a[i][1];c[i][2]=a[i][2];c[i][3]=a[i][3];
a[i][1]=a[i+1][1];a[i][2]=a[i+1][2];a[i][3]=a[i+1][3];
a[i+1][1]=c[i][1];a[i+1][2]=c[i][2];a[i+1][3]=c[i][3];
}
}
for(i=n-2;i>=1;i--)
{ if(a[i][2]+a[i][3]<a[i+1][2]+a[i+1][3])
{c[i][1]=a[i][1];c[i][2]=a[i][2];c[i][3]=a[i][3];
a[i][1]=a[i+1][1];a[i][2]=a[i+1][2];a[i][3]=a[i+1][3];
a[i+1][1]=c[i][1];a[i+1][2]=c[i][2];a[i+1][3]=c[i][3];
}
}
for(i=n-2;i>=2;i--)
{ if(a[i][2]+a[i][3]<a[i+1][2]+a[i+1][3])
{c[i][1]=a[i][1];c[i][2]=a[i][2];c[i][3]=a[i][3];
a[i][1]=a[i+1][1];a[i][2]=a[i+1][2];a[i][3]=a[i+1][3];
a[i+1][1]=c[i][1];a[i+1][2]=c[i][2];a[i+1][3]=c[i][3];
}
}
for(k=0;k<3;k++)
printf("%d %d\n",a[k][1],a[k][2]+a[k][3]);
return 0;
}
| 14 |
6,890 | 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 |
6,891 | /*
* jiegou1.cpp
*
* Created on: 2010-12-24
* Author: l
*/
struct student {
int No;
int china;
int math;
};//????student
int main(){
int n;
cin>>n;
struct student st[n];//??n????????st?n???????
int i;
for(i=0;i<n;i++)
cin>>st[i].No>>st[i].china>>st[i].math;
int s;
int a1=0,a2=0,a3=0,b1=0,b2=0,b3=0;//???????????????
for(i=0;i<n;i++)
{
s=st[i].china+st[i].math;
if(s>a1)
{
a3=a2;
b3=b2;
a2=a1;
b2=b1;
a1=s;
b1=i;
continue;//??????????????
}
if(s>a2)
{
a3=a2;
b3=b2;
a2=s;
b2=i;
continue;
}//??????????????
if(s>a3)
{
a3=s;
b3=i;
continue;
}//?????????????
}
cout<<st[b1].No<<" "<<a1<<endl;
cout<<st[b2].No<<" "<<a2<<endl;
cout<<st[b3].No<<" "<<a3<<endl;//????
return 0;
}
| 14 |
6,892 | int main()
{
long int n,a[100000][2];
int i,j,t,s;
struct Student
{int num;
int yu;
int shu;
};
scanf("%d",&n);
for(i=0;i<n;i++)
{
struct Student studenti;
scanf("%d%d%d",&studenti.num,&studenti.yu,&studenti.shu);
a[i][0]=studenti.num;
a[i][1]=studenti.yu+studenti.shu;
}
for(i=0;i<3;i++)
{ for(j=0;j<n-1-i;j++)
{if(a[j][1]>=a[j+1][1])
{t=a[j][1];a[j][1]=a[j+1][1];a[j+1][1]=t;
s=a[j][0];a[j][0]=a[j+1][0];a[j+1][0]=s;
}
}
}
for(i=1;i<=3;i++)
printf("%d %d\n",a[n-i][0],a[n-i][1]);
return 0;
}
| 14 |
6,893 | void main()
{
struct student
{
int num;
int sum;
}stu[100000],temp;
int total,i,j,chin,math;
scanf("%d",&total);
for(i = 0;i<total;i++)
{
scanf("%d %d %d",&stu[i].num,&chin,&math);
stu[i].sum = chin+math;
}
for(i = 2;i<5;i++)
{
for(j = total-i;j>=0;j--)
{
if(stu[j].sum<stu[j+1].sum)
{
temp = stu[j];
stu[j] = stu[j+1];
stu[j+1] = temp;
}
}
}
for(i = 0;i<3;i++)
printf("%d %d\n",stu[i].num,stu[i].sum);
} | 14 |
6,894 | 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 |
6,895 |
int main()
{
int n,i,k;
int a[99999][3],s[99999];
int fir=0,sec=0,thi=0;
int c=0,d=0,e=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(k=0;k<3;k++)
{
scanf("%d",&a[i][k]);
}
s[i]=a[i][1]+a[i][2];
}
for(i=0;i<n;i++)
{
if(s[i]>fir)
{
thi=sec;
sec=fir;
fir=s[i];
e=d;
d=c;
c=i;
continue;
}
if(s[i]>sec && s[i]<=fir)
{
thi=sec;
sec=s[i];
e=d;
d=i;
continue;
}
if(s[i]>thi && s[i]<=sec)
{
thi=s[i];
e=i;
}
}
printf("%d %d\n",a[c][0],fir);
printf("%d %d\n",a[d][0],sec);
printf("%d %d\n",a[e][0],thi);
return 0;
}
| 14 |
6,896 |
struct student
{
char id[20];
int chinese;
int math;
int score;
struct student *next;
};
int n;
struct student *create(int m)
{
struct student *head;
struct student *p1,*p2;
n=0;
p1=p2=(struct student *)malloc(length);
head=null;
while(n<m)
{
scanf("%s %d %d",p1->id,&p1->chinese,&p1->math);
n=n+1;
if(n==1) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(length);
}
p2->next=null;
return head;
}
void plus(struct student *head)
{
struct student *p,*q;
p=head;
if(head!=null)
{
do
{
p->score=p->chinese+p->math;
p=p->next;
}
while(p!=null);
}
}
void pri_top3(struct student *head)
{
struct student *p,*q,*p1,*p2,*p3;
p1=p2=p3=head;
p=head->next;
while(p!=null)
{
if(p->score>p1->score)
{
p3=p2;p2=p1;p1=p;
}
else if((p->score<=p1->score)&&(p->score>p2->score))
{
p3=p2;p2=p;
}
else if((p->score<=p2->score)&&(p->score>p3->score))
p3=p;
p=p->next;
}
printf("%s %d\n",p1->id,p1->score);
printf("%s %d\n",p2->id,p2->score);
printf("%s %d\n",p3->id,p3->score);
}
void main()
{
int m;
scanf("%d",&m);
struct student *p=create(m);
plus(p);
pri_top3(p);
}
| 14 |
6,897 | struct student
{
int number;
int ch;
int ma;
int sum;
int key;
}stu[100000];
void main()
{
int n,i,max=0,l=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].number,&stu[i].ch,&stu[i].ma);
stu[i].sum=stu[i].ch+stu[i].ma;
stu[i].key=0;
}
for(i=0;i<n;i++)
if(max<stu[i].sum&&stu[i].key==0)
{
max=stu[i].sum;
l=i;
}
printf("%d %d\n",l+1,max);
max=0;
stu[l].key=1;
l=0;
for(i=0;i<n;i++)
if(max<stu[i].sum&&stu[i].key==0)
{
max=stu[i].sum;
l=i;
}
printf("%d %d\n",l+1,max);
max=0;
stu[l].key=1;
l=0;
for(i=0;i<n;i++)
if(max<stu[i].sum&&stu[i].key==0)
{
max=stu[i].sum;
l=i;
}
printf("%d %d\n",l+1,max);
max=0;
stu[l].key=1;
l=0;
}
| 14 |
6,898 | int main(){
int num;
cin>>num;
struct {
int No;
int Chinese;
int Math;
int Sum; //??
}student[100000],t; //??????
int i,j;
for(i=0;i<num;i++){
cin>>student[i].No>>student[i].Chinese>>student[i].Math;
student[i].Sum=student[i].Math+student[i].Chinese;
}
for(i=0;i<3;i++) //????
for(j=0;j<num-1-i;j++){
if(student[j].Sum>=student[j+1].Sum){
t=student[j];
student[j]=student[j+1];
student[j+1]=t;
}
}
for(i=0;i<3;i++)
cout<<student[num-i-1].No<<" "<<student[num-i-1].Sum<<endl; //?????
return 0;
} | 14 |
6,899 | int main()
{
struct stu
{
char id[9];
int chn;
int math;
int both;
struct stu *next;
};
int n,i;
scanf("%d",&n);
struct stu *head,*p1,*p2;
for(i=0;i<n;i++)
{
if(i==0)
{
head=(struct stu*)malloc(sizeof(struct stu));
p1=head;
}
else
{
p1->next=(struct stu*)malloc(sizeof(struct stu));
p1=p1->next;
}
scanf("%s%d%d",p1->id,&p1->chn,&p1->math);
p1->both=p1->chn+p1->math;
}
p1->next=NULL;
int max;
for(i=0;i<3;i++)
{
max=head->both;
p1=head;
do
{
p1=p1->next;
if(max<p1->both)
{
max=p1->both;
p2=p1;
}
}while(p1->next!=NULL);
printf("%s %d\n",p2->id,p2->both);
p2->both=0;
}
return 0;
} | 14 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.