label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
14 | 6900 | struct student
{
int num;
int yuwen;
int shuxue;
int zongfen;
};
void main()
{
int n,i,j;
scanf("%d",&n);
struct student s[3],p,temp;
for(i=0;i<3;i++)
{
scanf("%d%d%d",&s[i].num,&s[i].yuwen,&s[i].shuxue);
s[i].zongfen=s[i].shuxue+s[i].yuwen;
}
for(i=0;i<2;i++)
{
for(j=0;j<2-i;j++)
{
if(s[j].zongfen<s[j+1].zongfen)
temp=s[j],s[j]=s[j+1],s[j+1]=temp;
}
}
for(i=3;i<n;i++)
{
scanf("%d%d%d",&p.num,&p.yuwen,&p.shuxue);
p.zongfen=p.shuxue+p.yuwen;
if(p.zongfen>s[2].zongfen&&p.zongfen<=s[1].zongfen)
s[2]=p;
else if(p.zongfen>s[1].zongfen&&p.zongfen<=s[0].zongfen)
s[2]=s[1],s[1]=p;
else if(p.zongfen>s[0].zongfen)
s[2]=s[1],s[1]=s[0],s[0]=p;
}
printf("%d %d\n%d %d\n%d %d",s[0].num,s[0].zongfen,s[1].num,s[1].zongfen,s[2].num,s[2].zongfen);
} |
14 | 6901 |
//??????????????????????
int main()
{
struct s
{
int id;
int ch;
int ma;
}s;
long int n;
int i=0,j,zong,c=0;
int a[3]={0},b[3]={0};
int t;
scanf("%d",&n);
for(i=0;i<3;i++)
{
scanf("%d %d %d",&s.id,&s.ch,&s.ma);
a[i]=i+1;
b[i]=s.ma+s.ch;
}
for(i=0;i<2;i++)
{
if(b[i]>b[1+i])
{
t=b[i];b[i]=b[i+1];b[i+1]=t;
t=a[i];a[i]=a[i+1];a[i+1]=t;
}
}
for(i=3;i<n;i++)
{
scanf("%d %d %d",&s.id,&s.ch,&s.ma);
zong= s.ch+s.ma;
for(j=0;j<3;j++)
{
if(zong>b[j])c++;
}
if(c==1)
{
a[0]=s.id;
b[0]=zong;
}
if(c==2)
{
a[0]=a[1];
b[0]=b[1];
a[1]=s.id;
b[1]=zong;
}
if(c==3)
{
a[0]=a[1];
a[1]=a[2];
a[2]=s.id;
b[0]=b[1];
b[1]=b[2];
b[2]=zong;
}
c=0;
}
for(i=2;i>=0;i--)
{
printf("%d %d\n",a[i],b[i]);
}
} |
14 | 6902 | 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 | 6903 | struct Student{
int no;
int chinese;
int math;
int total;
};
int main()
{
struct Student stu[100000],t;
int n,i,j,max,order;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&stu[i].no,&stu[i].chinese,&stu[i].math);
stu[i].total=stu[i].chinese+stu[i].math;
}
for(i=0;i<3;i++){
max=stu[i].total;
order=i;
for(j=i+1;j<n;j++){
if(stu[j].total>max){
max=stu[j].total;
order=j;
}
}
if(order!=i){
t=stu[i];stu[i]=stu[order];stu[order]=t;
}
printf("%d %d\n",stu[i].no,stu[i].total);
}
return 0;
} |
14 | 6904 | int main()
{
int n,i,j,b,c;
struct student
{
int id;
int score;
}stu[100000],t;
cin>>n;
for(i=0;i<n;i++)
{
cin>>stu[i].id>>b>>c;
stu[i].score=b+c;
}
for(i=0;i<3;i++)
{
for(j=n-1;j>i;j--)
{
if(stu[j].score>stu[j-1].score)
{
t=stu[j];
stu[j]=stu[j-1];
stu[j-1]=t;
}
}
}
for(i=0;i<3;i++)
{
cout<<stu[i].id<<' '<<stu[i].score<<endl;
}
return 0;
} |
14 | 6905 |
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 | 6906 | struct student
{
int count;
int yu;
int shu;
}stu[1000000];
void main()
{
int n,i,*p,max=0,sm=0,tm=0,j=0;
p=(int *)malloc(1000000*sizeof(int));
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].count,&stu[i].yu,&stu[i].shu);
*(p+i)=stu[i].yu+stu[i].shu;
}
for(i=0;i<n;i++)
max=(max>*(p+i))?max:(*(p+i));
for(i=0;i<n;i++)
{if((*(p+i)<max)&&(*(p+i)>sm))
sm=*(p+i);}
for(i=0;i<n;i++)
{if((*(p+i)>tm)&&(*(p+i)<sm))
tm=*(p+i);}
for(i=0;j<3,i<n;i++)
{
if(*(p+i)==max)
{
printf("%d %d\n",stu[i].count,max);
j++;
}
}
for(i=0;j<3,i<n;i++)
{if(*(p+i)==sm&&j<3)
{
printf("%d %d\n",stu[i].count,sm);
j++;
}
}
for(i=0;j<3,i<n;i++)
{
if(*(p+i)==tm&&j<3)
{
printf("%d %d\n",stu[i].count,tm);
j++;
}
}
} |
14 | 6907 |
struct student
{
int num;
int chn;
int math;
int score;
} stu[100000];
main()
{
int n,i,a,b,c;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&stu[i].num,&stu[i].chn,&stu[i].math);
stu[i].score=stu[i].chn+stu[i].math;
}
if(stu[0].score>=stu[1].score){
if(stu[1].score>=stu[2].score){
a=0;
b=1;
c=2;
}
else if(stu[0].score>=stu[2].score){
a=0;
b=2;
c=1;
}
else{
a=2;
b=0;
c=1;
}
}
else{
if(stu[0].score>=stu[2].score){
a=1;
b=0;
c=2;
}
else if(stu[1].score>=stu[2].score){
a=1;
b=2;
c=0;
}
else{
a=2;
b=1;
c=0;
}
}
for(i=3;i<n;i++){
if(stu[i].score>stu[a].score){
c=b;
b=a;
a=i;
}
else if(stu[i].score>stu[b].score){
c=b;
b=i;
}
else if(stu[i].score>stu[c].score){
c=i;
}
}
printf("%d %d\n%d %d\n%d %d\n",stu[a].num,stu[a].score,stu[b].num,stu[b].score,stu[c].num,stu[c].score);
} |
14 | 6908 | struct Student
{
int num;
int chinese;
int math;
int score;
};
int main()
{
int n;
int i,k,j;
struct Student student[100000];
struct Student temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&student[i].num);
scanf("%d",&student[i].chinese);
scanf("%d",&student[i].math);
student[i].score=student[i].chinese+student[i].math;
}
for(i=0;i<3;i++)
{
k=i;
for(j=i+1;j<n;j++)
{
if(student[j].score>student[k].score) k=j;
}
if(k!=i)
{
temp=student[i];
student[i]=student[k];
student[k]=temp;
}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",student[i].num,student[i].score);
}
return 0;
} |
14 | 6909 | void main()
{ int m1,m2,m3,n1,n2,n3;
struct student{int num;int verbal;int math;int sum;};
struct student stu[100000];
struct student *p;
p=stu;
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d",&(p+i)->num,&(p+i)->verbal,&(p+i)->math);
for(i=0;i<n;i++)
(p+i)->sum=(p+i)->verbal+(p+i)->math;
m1=p->sum;n1=0;
for(i=0;i<n;i++)
if(((p+i)->sum)>m1)
{m1=(p+i)->sum;
n1=i;}
printf("%d %d\n",(p+n1)->num,(p+n1)->sum);
m2=p->sum;n2=0;
for(i=0;i<n;i++)
if(((p+i)->sum)>m2&&i!=n1)
{m2=(p+i)->sum;
n2=i;}
printf("%d %d\n",(p+n2)->num,(p+n2)->sum);
m3=p->sum;n3=0;
for(i=0;i<n;i++)
if((((p+i)->sum)>m3)&&i!=n1&&i!=n2)
{m3=(p+i)->sum;
n3=i;}
printf("%d %d\n",(p+n3)->num,(p+n3)->sum);
}
|
14 | 6910 | int x[100000],y[100000],z[100000],s[100000],b[100000];
int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
int i,j,t,m1,m2;
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&x[i],&y[i],&z[i]);
s[i]=y[i]+z[i];
b[i]=s[i];
}
for(i=1;i<4;i++)
{
for(j=i+1;j<=n;j++)
{
if(s[i]<s[j])
{
t=s[i];
s[i]=s[j];
s[j]=t;
}
}
}
for(i=1;i<=n;i++)
{
if(s[1]==b[i])
{
m1=i;
printf("%d %d\n",x[i],b[i]);
break;
}
}
for(i=1;i<=n;i++)
{
if(s[2]==b[i]&&i!=m1)
{
m2=i;
printf("%d %d\n",x[i],b[i]);
break;
}
}
for(i=1;i<=n;i++)
{
if(s[3]==b[i]&&i!=m1&&i!=m2)
{
printf("%d %d\n",x[i],b[i]);
break;
}
}
return 0;
}
|
14 | 6911 | 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 | 6912 | struct student
{
int id;
int chinese;
int math;
int total;
};
int main()
{
struct student stu[100000];
struct student max[3]={0,0,0,0,0,0,0,0,0,0,0,0};
int n,i;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d %d %d\n",&stu[i].id,&stu[i].chinese,&stu[i].math);
stu[i].total = stu[i].chinese + stu[i].math;
}
for (i=0;i<n;i++)
{
if (stu[i].total > max[1].total)
{
max[1]=stu[i];
}
}
for (i=0;i<n;i++)
{
if (stu[i].total > max[2].total && stu[i].total <= max[1].total && stu[i].id!=max[1].id)
{
max[2]=stu[i];
}
}
for (i=0;i<n;i++)
{
if (stu[i].total > max[3].total && stu[i].total <= max[2].total && stu[i].id!=max[2].id && stu[i].id!=max[1].id)
{
max[3]=stu[i];
}
}
for (i=1;i<4;i++)
{
printf("%d %d\n",max[i].id,max[i].total);
}
return 0;
} |
14 | 6913 | 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 | 6914 | void main()
{
struct student
{
int a;int math;int chi;int sum;struct student*next;
};
int n,i;int max;
struct student *p1,*p2,*head;
scanf("%d",&n);
head=NULL;
for(i=0;i<n;i++)
{
if(i==0) head=p1=(struct student*)malloc(LEN);
else {
p1->next=(struct student*)malloc(LEN);p1=p1->next;
}
scanf("%d%d%d",&p1->a,&p1->math,&p1->chi);
p1->sum=(p1->math)+(p1->chi);
}
p1->next=NULL;
for(i=0;i<3;i++)
{
p1=head;max=p1->sum;
do
{p1=p1->next;
if(p1->sum>max) {max=p1->sum;p2=p1;}
}while(p1->next!=NULL);
printf("%d %d\n",p2->a,p2->sum);
p2->sum=0;
}
}
|
14 | 6915 |
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 | 6916 |
int main (int argc, char *argv[])
{
int n;
scanf("%d",&n);
struct
{ int id;int yuwen;int shuxue;}stu[1000001];
int grade[100000];
int i,a,b;
int m1=0,m2=0,m3=0;
int m1id,m2id,m3id;
for(i=0;i<n;i++)
{
scanf("%d",&stu[i].id);
scanf("%d",&stu[i].yuwen);
scanf("%d",&stu[i].shuxue);
grade[i]=stu[i].yuwen+stu[i].shuxue;
}
for(i=0;i<n;i++)
{ if(grade[i]>m1)
{m1=grade[i];
a=i;
m1id=stu[i].id;}
}
printf("%d ",m1id);
printf("%d\n",m1);
for(i=0;i<n;i++)
{ if((grade[i]>m2)&&(i!=a))
{m2=grade[i];
b=i;
m2id=stu[i].id;}
}
printf("%d ",m2id);
printf("%d\n",m2);
for(i=0;i<n;i++)
{ if((grade[i]>m3)&&(i!=a)&&(i!=b))
{ m3=grade[i];
m3id=stu[i].id;
}
}
printf("%d ",m3id);
printf("%d\n",m3);
return 0;
}
|
14 | 6917 | struct Student
{ int num;
int ch;
int math;
int sum;
};
int main()
{
struct Student stu[4],temp;
int i,j,k,n;
scanf("%d",&n);
for(i=0;i<3;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].ch,&stu[i].math);
stu[i].sum=stu[i].ch+stu[i].math;
}
for(i=0;i<2;i++)
{
k=i;
for(j=i+1;j<3;j++)
if(stu[j].sum>stu[i].sum)
{k=j;
temp=stu[k];
stu[j]=stu[i];
stu[i]=temp;}
}
// for(i=0;i<3;i++)
// printf("%d %d\n",stu[i].num,stu[i].sum);
for(i=3;i<n;i++)
{
scanf("%d %d %d",&stu[3].num,&stu[3].ch,&stu[3].math);
stu[3].sum=stu[3].ch+stu[3].math;
if(stu[3].sum>stu[0].sum)
{
stu[2]=stu[1];
stu[1]=stu[0];
stu[0]=stu[3];
}
else if(stu[3].sum>stu[1].sum)
{
stu[2]=stu[1];
stu[1]=stu[3];
}
else if(stu[3].sum>stu[2].sum)
stu[2]=stu[3];
}
for(i=0;i<3;i++)
printf("%d %d\n",stu[i].num,stu[i].sum);
return 0;
} |
14 | 6918 | struct stu
{
int a;
int b;
int c;
int d;
struct stu *next;
};
int n;
struct stu *creat(void)
{
struct stu *head,*p1,*p2;
int i=1;
head=NULL;
p2=p1=(struct stu *)malloc(LEN);
scanf("%d%d%d",&p1->a,&p1->b,&p1->c);
p1->d=p1->b+p1->c;
while(1)
{
if(i==1)
head=p1;
else
p2->next=p1;
p2=p1;
if(i>=n) break;
p1=(struct stu *)malloc(LEN);
scanf("%d%d%d",&p1->a,&p1->b,&p1->c);
p1->d=p1->b+p1->c;
i++;
}
p2->next=NULL;
return(head);
}
void main()
{
struct stu *z,*p3,*p[100007],*q;
int i=0,j,m;
scanf("%d",&n);
z=creat();
p3=p[i]=z;
while(p3!=NULL)
{
i++;
p[i]=p3->next;
p3=p[i];
}
m=i;
q=p[0];
for(i=0;i<4;i++)
{
for(j=0;j<m-1-i;j++)
{
if(p[j]->d>=p[j+1]->d)
{
q=p[j];
p[j]=p[j+1];
p[j+1]=q;
}
}
}
for(i=1;i<4;i++)
{
printf("%d %d\n",p[m-i]->a,p[m-i]->d);
}
} |
14 | 6919 | struct student
{
int num;
int all;
}person[99999];
int main()
{
int n,i,j,k,x,y;;
struct student temp1,temp2;
scanf("%d",&n);
for(i=2;i>=0;i--)
{
scanf("%d %d %d",&person[i].num,&x,&y);
person[i].all=x+y;
}
for(i=3;i<=n-1;i++)
{
scanf("%d %d %d",&person[i].num,&x,&y);
person[i].all=x+y;
k=person[i].all;
if(k>person[0].all) {temp1=person[0]; temp2=person[1]; person[0]=person[i];person[1]=temp1;person[2]=temp2; continue;}
if(k<=person[0].all&&k>person[1].all) {temp1=person[1];person[1]=person[i];person[2]=temp1; continue;}
if(k<=person[1].all&&k>person[2].all) {person[2]=person[i]; continue;}
if(k<person[2].all) {continue;}
}
printf("%d %d\n",person[0].num,person[0].all);
printf("%d %d\n",person[1].num,person[1].all);
printf("%d %d",person[2].num,person[2].all);
return 0;
} |
14 | 6920 | struct student
{
int a;
int b;
int c;
struct student *next;
};
void main()
{
int n=0,i,j,k;
scanf("%d",&k);
struct student *head,*p1,*p2;
p1=p2=(struct student *)malloc(L);
scanf("%d %d %d",&p1->a,&p1->b,&p1->c);
head=NULL;
for(i=0;i<k-1;i++)
{
n=n+1;
if(n==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(L);
scanf("%d %d %d",&p1->a,&p1->b,&p1->c);
}
p2->next=p1;
p2=p1;
p2->next=NULL;
struct student *g;
int x[100000],y[100000];
g=head;
for(i=0;i<k;i++)
{
x[i]=g->a;
y[i]=g->b+g->c;
g=g->next;
}
int m[4]={0},t,r=1,z=0;
m[0]=201;
for(i=0;i<3;i++)
{
for(j=0;j<k;j++)
{
if(m[r]<y[j]&&y[j]<m[r-1])
m[r]=y[j];
}
r++;
}
for(i=0;i<k;i++)
{
if(z==3)break;
if(y[i]==m[1])
{
printf("%d %d\n",x[i],y[i]);
z++;
}
}
for(i=0;i<k;i++)
{
if(z==3)break;
if(y[i]==m[2])
{
printf("%d %d\n",x[i],y[i]);
z++;
}
}
for(i=0;i<k;i++)
{
if(z==3)break;
if(y[i]==m[3])
{
printf("%d %d",x[i],y[i]);
z++;
}
}
} |
14 | 6921 | struct stu
{
int num,yu,shu,sum;
} ;
void main()
{
int n,i;
struct stu a[4];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d%d%d",&a[0].num,&a[0].yu,&a[0].shu);
a[0].sum=a[0].yu+a[0].shu;
if (a[0].sum>a[1].sum)
{
a[3].sum=a[2].sum;
a[3].num=a[2].num;
a[2].sum=a[1].sum;
a[2].num=a[1].num;
a[1].sum=a[0].sum;
a[1].num=a[0].num;
}else
if (a[0].sum>a[2].sum)
{
a[3].sum=a[2].sum;
a[3].num=a[2].num;
a[2].sum=a[0].sum;
a[2].num=a[0].num;
}
else if (a[0].sum>a[3].sum)
{
a[3].sum=a[0].sum;
a[3].num=a[0].num;
}
}
for (i=1;i<=3;i++)
printf("%d %d\n",a[i].num,a[i].sum);
} |
14 | 6922 | struct stu
{
int id;
int shu;
int yu;
int he;
};
struct stu stu[100000];
int main()
{
int n,i,max,sec,th;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&stu[i].id,&stu[i].shu,&stu[i].yu);
stu[i].he=stu[i].shu+stu[i].yu;
}
max=1;
for(i=1;i<n;i++)
{
if(stu[max].he<stu[i+1].he)
max=i+1;
}
printf("%d %d\n",stu[max].id,stu[max].he);
stu[max].he=0;
sec=1;
for(i=1;i<n;i++)
{
if(stu[sec].he<stu[i+1].he)
sec=i+1;
}
printf("%d %d\n",stu[sec].id,stu[sec].he);
stu[sec].he=0;
th=1;
for(i=1;i<n;i++)
{
if(stu[th].he<stu[i+1].he)
th=i+1;
}
printf("%d %d\n",stu[th].id,stu[th].he);
getchar();
getchar();
}
|
14 | 6923 | int main(int argc, char* argv[])
{
int x[100000];
int i,j,n,s,y,p;
int b[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&x[i],&y,&p);
b[i]=y+p;
}
int t;
for(i=0;i<3;i++)
{
for(j=i+1;j<n;j++)
{
if(b[j]>b[i])
{
s=x[i];
x[i]=x[j];
x[j]=s;
t=b[i];
b[i]=b[j];
b[j]=t;
}
}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",x[i],b[i]);
}
return 0;
}
|
14 | 6924 |
int main()
{
struct Student
{
int ID;
int Chinese;
int Math;
int sum;
}student[100000];
int i,j,n;
struct Student t;
scanf("%d", &n);
for(i=0;i<n;i++)
scanf("%d%d%d",&student[i].ID,&student[i].Chinese,&student[i].Math);
for(i=0;i<3;i++)
{
for(j=i+1;j<n;j++)
{
if(student[i].Chinese+student[i].Math<student[j].Chinese+student[j].Math)
{
t=student[i];
student[i]=student[j];
student[j]=t;
}
}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",student[i].ID,student[i].Chinese+student[i].Math);
}
return 0;
}
|
14 | 6925 | 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 | 6926 | int main()
{
struct student
{
char ID[10];
int m;
int c;
}tmp;
int max1=0,max2=0,max3=0;
int a1=0,a2=0,a3=0;
int n,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d",tmp.ID,&(tmp.m),&(tmp.c));
if((tmp.m+tmp.c)>max1)
{
max3=max2;
max2=max1;
max1=tmp.m+tmp.c;
a3=a2;
a2=a1;
a1=i;
}
else if((tmp.m+tmp.c)==max1)
{
max3=max2;
max2=max1;
max1=tmp.m+tmp.c;
a3=a2;
a2=i;
}
else if((tmp.m+tmp.c)<max1 && (tmp.m+tmp.c)>max2)
{
max3=max2;
max2=tmp.m+tmp.c;
a3=a2;
a2=i;
}
else if((tmp.m+tmp.c)==max2)
{
max3=max2;
a3=atoi(tmp.ID);
}
else if((tmp.m+tmp.c)<max2 && (tmp.m+tmp.c)>max3)
{
max3=tmp.m+tmp.c;
a3=i;
}
}
printf("%d %d\n",a1,max1);
printf("%d %d\n",a2,max2);
printf("%d %d\n",a3,max3);
return 0;
}
|
14 | 6927 | int main(int argc, char* argv[])
{
struct test {
int ID,chinese,maths,sum;
} ss[100000];
int i,n;
scanf ("%d",&n);
for (i=1;i<=n;i++)
{
scanf ("%d%d%d",&ss[i].ID,&ss[i].chinese,&ss[i].maths);
ss[i].sum=ss[i].chinese+ss[i].maths;
}
struct score {
int ID,sum;
} s[5];
s[1].sum=0;
s[2].sum=0;
s[3].sum=0;
for (i=0;i<=n;i++)
{
if (ss[i].sum>s[1].sum)
{
s[3].ID=s[2].ID;
s[3].sum=s[2].sum;
s[2].ID=s[1].ID;
s[2].sum=s[1].sum;
s[1].ID=ss[i].ID;
s[1].sum=ss[i].sum;
}
else if (ss[i].sum>s[2].sum)
{
s[3].ID=s[2].ID;
s[3].sum=s[2].sum;
s[2].ID=ss[i].ID;
s[2].sum=ss[i].sum;
}
else if (ss[i].sum>s[3].sum)
{
s[3].ID=ss[i].ID;
s[3].sum=ss[i].sum;
}
}
for (i=1;i<=3;i++)
{
printf ("%d %d\n",s[i].ID,s[i].sum);
}
return 0;
}
|
14 | 6928 | struct student
{int math;
int chi;
int num;
int sum;
};
void main()
{
int i,j,k,n,t,m;
struct student stu[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d",&stu[i].num,&stu[i].math,&stu[i].chi);
for(i=0;i<n;i++)
stu[i].sum=stu[i].math+stu[i].chi;
for(i=0;i<3;i++)
{for(j=i+1,k=i;j<n;j++)
{
if(stu[j].sum>stu[k].sum)
k=j;
}
t=stu[i].sum;stu[i].sum=stu[k].sum;stu[k].sum=t;
m=stu[i].num;stu[i].num=stu[k].num;stu[k].num=m;
}
for(i=0;i<3;i++)
printf("%d %d\n",stu[i].num,stu[i].sum);
} |
14 | 6929 | struct student
{
int ID;
int Chinese;
int Math;
int Score;
};
main()
{
int n,i,first=0,ifirst,second=0,isecond,third=0,ithird;
scanf("%d",&n);
struct student STUDENT_NUM[n];
for(i=0;i<n;i++)
{
scanf("%d %d %d",&STUDENT_NUM[i].ID,&STUDENT_NUM[i].Chinese,&STUDENT_NUM[i].Math);
STUDENT_NUM[i].Score=STUDENT_NUM[i].Chinese+STUDENT_NUM[i].Math;
}
for(i=0;i<n;i++)
{
if(first<STUDENT_NUM[i].Score)
{
first=STUDENT_NUM[i].Score;
ifirst=i;
}
}
for(i=0;i<n;i++)
{
if(second<STUDENT_NUM[i].Score&&STUDENT_NUM[i].Score<=first&&i!=ifirst)
{
second=STUDENT_NUM[i].Score;
isecond=i;
}
}
for(i=0;i<n;i++)
{
if(third<STUDENT_NUM[i].Score&&STUDENT_NUM[i].Score<=second&&i!=ifirst&&i!=isecond)
{
third=STUDENT_NUM[i].Score;
ithird=i;
}
}
printf("%d %d\n",STUDENT_NUM[ifirst].ID,first);
printf("%d %d\n",STUDENT_NUM[isecond].ID,second);
printf("%d %d\n",STUDENT_NUM[ithird].ID,third);
}
|
14 | 6930 |
struct student{
int a;
int b;
int c;//?????????????
};
int main(int argc, char* argv[])
{
int n,i,j,temp,temp2,sum=0;
int max1,max2,max3,id1,id2,id3;
scanf("%d",&n);
struct student*s=(struct student*)malloc(n*sizeof(struct student));
int*end=(int*)malloc(n*sizeof(int));//??????????????????????
for(i=0;i<n;i++){
scanf("%d %d %d",&s[i].a,&s[i].b,&s[i].c);
end[i]=s[i].b+s[i].c;
}
max1=-100;max2=-100;max3=-100;
id1=s[0].a; id2=s[0].a; id3=s[0].a;
for(i=0;i<n;i++)
if(end[i]>max1){
max1=end[i];
id1=s[i].a;
}//?????
for(i=0;i<n;i++)
if(end[i]!=max1&&end[i]>max2){
max2=end[i];
id2=s[i].a;
}//?????
for(i=0;i<n;i++)
if(end[i]!=max1&&end[i]!=max2&&end[i]>max3){
max3=end[i];
id3=s[i].a;
}//???????(????????????????????????????????)
for(i=0;i<n;i++){
if(end[i]==max1){
printf("%d %d\n",s[i].a,max1);
sum++;
}
}
for(i=0;i<n;i++){
if(sum<=2&&end[i]==max2){
printf("%d %d\n",s[i].a,max2);
sum++;
}
}
for(i=0;i<n;i++){
if(sum<=2&&end[i]==max3){
printf("%d %d\n",s[i].a,max3);
}
}//???????????????????????
free(s);
free(end);
return 0;
}
|
14 | 6931 | void main()
{
int n,i,j,max,k;
struct stu
{
int num;
int chinese;
int maths;
int all;
}stu[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d%d",&stu[i].num,&stu[i].chinese,&stu[i].maths);
for(i=0;i<n;i++)
stu[i].all=stu[i].chinese+stu[i].maths;
for(k=0;k<3;k++)
{
max=stu[0].all;
for(i=0;i<n;i++)
{
if(stu[i].all>max)
{
max=stu[i].all;
j=i;
}
}
printf("%d %d\n",stu[j].num,stu[j].all);
stu[j].all=0;
}
}
|
14 | 6932 | struct grade
{
int num;
int chinese;
int math;
int all;
}stu[100000];
int main()
{
int n,i,e,f,g,a,b,c;
e=0;
f=0;
g=0;
a=0;
b=0;
c=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%d%d%d",&stu[i].num,&stu[i].chinese,&stu[i].math);
stu[i].all=stu[i].chinese+stu[i].math;
}
for(i=0;i<=n-1;i++){
if(stu[i].all>e){
e=stu[i].all;
a=i;
}
}
for(i=0;i<=n-1;i++){
if(stu[i].all<=e&&stu[i].all>f&&i!=a){
f=stu[i].all;
b=i;
}
}
for(i=0;i<=n-1;i++){
if(stu[i].all<=f&&stu[i].all>g&&i!=a&&i!=b){
g=stu[i].all;
c=i;
}
}
printf("%d %d\n",stu[a].num,stu[a].all);
printf("%d %d\n",stu[b].num,stu[b].all);
printf("%d %d\n",stu[c].num,stu[c].all);
return 0;
} |
14 | 6933 | void main()
{
struct student
{
long int num;
int score1;
int score2;
};
struct student stu[100000];
long int n;
int i,j,k,m,a=0,b=0,c=0,A,B,C;
A=B=C=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].score1,&stu[i].score2);
k=stu[i].score1+stu[i].score2;
if(k>c)
{
c=k;
C=stu[i].num;
}
if(c>b)
{
m=c;
c=b;
b=m;
m=C;
C=B;
B=m;
}
if(b>a)
{
m=b;
b=a;
a=m;
m=B;
B=A;
A=m;
}
}
printf("%d %d\n%d %d\n%d %d",A,a,B,b,C,c);
}
|
14 | 6934 |
struct stu
{
int num;
int ch;
int math;
int total;
} a[100000];
struct str
{
int num;
int total;
} b[100000];
main()
{
int i,n,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d %d %d\n",&a[i].num,&a[i].ch,&a[i].math);
b[i].num=a[i].num;
b[i].total=a[i].ch+a[i].math;}
for(i=0; i<3; i++)
{
for(j=i+1;j<n;j++)
if (b[i].total<b[j].total)
{
b[n]=b[i];
b[i]=b[j];
b[j]=b[n];
}
}
for(i=0;i<3;i++)
printf("%d %d\n",b[i].num,b[i].total);
}
|
14 | 6935 | long int n;
struct stu
{
long int num,chi,mat,tot;
};
int comp(const void *a , const void *b)
{
return ((struct stu*)b)->tot-((struct stu*)a)->tot;
}
struct stu a[100000],b;
int main()
{
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a[i].num,&a[i].chi,&a[i].mat);
a[i].tot=a[i].chi+a[i].mat;
}
qsort(a,n,sizeof(struct stu),comp);
for(i=0;i<3;i++)
printf("%d %d\n",a[i].num,a[i].tot);
return 0;
} |
14 | 6936 | struct student
{
int num;
int chi;
int math;
int sum;
struct student *next;
};
int n,k;
void main()
{int i,j;
scanf("%d",&n);
int m;
m=0;
struct student *head;
struct student *p1,*p2;
p1=p2=(struct student *)malloc(len);
scanf("%d %d %d",&p1->num,&p1->chi,&p1->math);
p1->sum=p1->chi+p1->math;
head=p1;
while(m<n-1)
{m=m+1;
p1=(struct student *)malloc(len);
scanf("%d %d %d",&p1->num,&p1->chi,&p1->math);
p1->sum=p1->chi+p1->math;
p2->next=p1;
p2=p1;
}
p2->next=0;
struct student *max,*p;
for(i=0;i<3;i++)
{ max=head;
p=p2=head;
p1=p2;
for(j=0;j<n-i;j++)
{ if(p1->sum>max->sum)
{max=p1;
p=p2;}
p2=p1;
p1=p2->next;}
p1=p2=head;
printf("%d %d\n",max->num,max->sum);
if(max->num==head->num)
head=p1->next;
else p->next=max->next;
}
}
|
14 | 6937 | 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.num=max2.num;
max3.z=max2.z;
max2.num=max1.num;
max2.z=max1.z;
max1.num=a.num;
max1.z=a.z;
}
else if (a.z>max2.z)
{
max3.num=max2.num;
max3.z=max2.z;
max2.num=a.num;
max2.z=a.z;
}else if (a.z>max3.z)
{
max3.num=a.num;
max3.z=a.z;
}
}
printf("%d %d\n%d %d\n%d %d\n",max1.num,max1.z,max2.num,max2.z,max3.num,max3.z);
} |
14 | 6938 | struct Student
{
int num;
int yuwen;
int math;
}temp,stu[100050];
int main()
{
int n,i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].yuwen,&stu[i].math);
stu[i].math=stu[i].yuwen+stu[i].math;
}
for(i=0;i<3;i++)
{
k=i;
for(j=i+1;j<n;j++)
if(stu[j].math>stu[k].math)
k=j;
temp=stu[k];stu[k]=stu[i];stu[i]=temp;
}
for(i=0;i<3;i++)
printf("%d %d\n",stu[i].num,stu[i].math);
} |
14 | 6939 | struct student
{
int num,a,b;
struct student *next;
};
int n;
struct student *create(void)
{
struct student *head;
struct student *p1,*p2;
int i;
i=1;
p1=p2=(struct student*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->a,&p1->b);
head=NULL;
while(1)
{
if(i==1)
head=p1;
else
p2->next=p1;
p2=p1;
if(i==n)
break;
p1=(struct student*)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->a,&p1->b);
i++;
}
p2->next=NULL;
return(head);
}
void main()
{
struct student *head,*h,*x;
scanf("%d",&n);
head=create();
h=x=head;
int (*p)[2],m,j,s,i;
p=(int(*)[2])calloc(100000,2*sizeof(int));
for(i=0;i<n;i++)
{
p[i][1]=h->a+h->b;
p[i][0]=h->num;
h=x->next;
x=h;
}
for(i=0;i<3;i++)
for(j=0;j<n-i-1;j++)
if(p[j][1]>=p[j+1][1])
{
m=p[j][1];
p[j][1]=p[j+1][1];
p[j+1][1]=m;
s=p[j][0];
p[j][0]=p[j+1][0];
p[j+1][0]=s;
}
for(i=n-1;i>n-4;i--)
printf("%d %d\n",p[i][0],p[i][1]);
} |
14 | 6940 | struct student
{
int id;
int chinese;
int math;
int sum;
struct student* next;
};
int n;
struct student *creat()
{
struct student *head,*p1,*p2;
p1=p2=(struct student*)malloc(len);
scanf("%d",&n);
scanf("%d%d%d",&p1->id,&p1->chinese,&p1->math);
p1->sum=p1->chinese+p1->math;
head=NULL;
for(;p1->id<n;)
{
if(p1->id==1) head=p1;
p1=(struct student*)malloc(len);
scanf("%d%d%d",&p1->id,&p1->chinese,&p1->math);
p1->sum=p1->chinese+p1->math;
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return(head);
}
void main()
{
struct student *head,*p1,*p2,*p3,*p;
head=creat();
for(p=head,p1=head,p2=head,p3=head;p!=NULL;p=p->next)
{
if(p->sum>p1->sum)
{
p3=p2;
p2=p1;
p1=p;
}
else if(p->sum>p2->sum)
{
p3=p2;
p2=p;
}
else if(p->sum>p3->sum)
{
p3=p;
}
}
printf("%d %d\n",p1->id,p1->sum);
printf("%d %d\n",p2->id,p2->sum);
printf("%d %d\n",p3->id,p3->sum);
}
|
14 | 6941 | struct student
{char num[10];
int chinese;
int math;
int sum;
struct student *next;
};
int n;
struct student *creat(int n)
{
struct student *head,*p1,*p2;
p1=p2=(struct student *)malloc(LEN);
scanf("%s %d %d",p1->num,&p1->chinese,&p1->math);
p1->sum=p1->chinese+p1->math;
head=NULL;
int t=n;
while(n>1)
{
if(n==t) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%s %d %d",p1->num,&p1->chinese,&p1->math);
p1->sum=p1->chinese+p1->math;
n--;
}
p2->next=NULL;
return(head);
}
void main()
{
int n,i;struct student *first,*second,*third;
int fir_index,sec_index,thr_index;
scanf("%d",&n);struct student *head,*p1;struct student stu;
head=creat(n);
first=head;second=head;third=head;
for(p1=head;p1->next!=NULL;p1=p1->next)
{
if(p1->sum>first->sum)
{
third=second;second=first;first=p1;
}
else if(p1->sum>second->sum)
{
third=second;second=p1;
}
else if(p1->sum>third->sum)
{
third=p1;
}
}
printf("%s %d\n",first->num,first->sum);
printf("%s %d\n",second->num,second->sum);
printf("%s %d\n",third->num,third->sum);
}
|
14 | 6942 |
struct info
{
char id[10];
float ch;
float ma;
float tot;
struct info * next;
};
void main()
{
struct info * head, * pre, * p,* t;
int i,j,n;
scanf("%d",&n);
head=pre=p=LEN;
for(i=0;i<2;i++)
{
p->tot=0;
p=LEN;
pre->next=p;
pre=p;
}
p->tot=0;
p->next=NULL;
for(i=0;i<n;i++)
{
p=LEN;
scanf("%s %f %f",p->id,&p->ch,&p->ma);
p->tot=p->ch+p->ma;
if(p->tot>head->tot)
{
p->next=head;
head=p;
}
else
{ pre=head;
t=head->next;
for(j=1;j<=2;j++)
{
if(p->tot>t->tot)
{ pre->next=p;
p->next=t;break;
}
pre=t;
t=t->next;
}
}
}
p=head;
for(i=0;i<3;i++)
{
printf("%s %g\n",p->id,p->tot);
p=p->next;
}
} |
14 | 6943 | 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 | 6944 |
int main()
{
int Student_Num;
cin>>Student_Num;
//??
struct A
{
int ID;
int chinese;
int math;
int total;
}student[100000+10],a[3];
//?????
for(int i=0;i<=Student_Num-1;i++)
{
cin>>student[i].ID;
cin>>student[i].chinese;
cin>>student[i].math;
student[i].total=student[i].math+student[i].chinese;
}
//????
a[0]=a[1]=a[2]=student[0];
for(int i=0;i<=Student_Num-1;i++)
{
if(student[i].total>a[0].total)a[0]=student[i];
}
for(int i=0;i<=Student_Num-1;i++)
{
if(student[i].total>a[1].total&&student[i].total<=a[0].total&&student[i].ID!=a[0].ID)a[1]=student[i];
}
for(int i=0;i<=Student_Num-1;i++)
{
if(student[i].total>a[2].total&&student[i].total<=a[1].total&&student[i].ID!=a[0].ID&&student[i].ID!=a[1].ID)a[2]=student[i];
}
//??
for(int i=0;i<=2;i++)
{
cout<<a[i].ID<<" "<<a[i].total<<endl;
}
//??
return 0;
} |
14 | 6945 |
struct stu
{
int num;
int ch;
int ma;
};
int main()
{
int n,i,j,score[100000],max[2];
struct stu STU[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&STU[i].num,&STU[i].ch,&STU[i].ma);
score[i]=STU[i].ch+STU[i].ma;
}
for(j=0;j<3;j++)
{
for(i=0;i<n;i++)
{
if(score[i]>max[1])
{
max[0]=STU[i].num;
max[1]=score[i];
}
}
printf("%d %d\n",max[0],max[1]);
max[1]=0;
int temp=max[0];
score[temp-1]=0;
}
return 0;
}
|
14 | 6946 | struct Student
{
int num;
int chi;
int math;
int total;
}person[100000],first[3]={{0,0,0,0},{0,0,0,0},{0,0,0,0}};
int main()
{
long n;
int i,j;
scanf("%ld",&n);
for(i=0;i<n;i++)
{
scanf("%ld%d%d",&person[i].num,&person[i].chi,&person[i].math);
person[i].total=person[i].chi+person[i].math;
if(person[i].total>first[0].total){first[1]=first[0];first[0]=person[i];}
else
if(person[i].total>first[1].total){first[2]=first[1];first[1]=person[i];}
else
if(person[i].total>first[2].total){first[2]=person[i];}
}
for(j=0;j<3;j++)
{
printf("%ld %d\n",first[j].num,first[j].total);
}
}
|
14 | 6947 | struct stu
{
long num;
int score1;
int score2;
struct stu *next;
};
struct stu *creat(void)
{
int n,i=1;
struct stu *head;
struct stu *p1,*p2;
scanf("%d",&n);
p1=p2=(struct stu*)malloc(len);
head=NULL;
while(i<=n)
{
scanf("%ld %d %d",&p1->num,&p1->score1,&p1->score2);
if(i==1)head=p1;
else p2=p1;
if(i!=n)p1=p2->next=(struct stu*)malloc(len);
else p1->next=NULL;
i++;
}
return(head);
}
void turn(struct stu *head)
{
int t=1,r=1,a;
struct stu *q1,*q2,*p3,*p1,*p2;
for(q1=p3=p2=head;q1->next!=NULL,t<=3;t++)
{
a=0;
for(q2=p1=q1->next,r=1;q2!=NULL;q2=q2->next,r++)
{
if((q1->score1+q1->score2)<(q2->score1+q2->score2))
{
q1=q2;p2=p1;a=1;
}
if(r!=1)p1=p1->next;
}
printf("%ld %d\n",q1->num,q1->score1+q1->score2);
if(a==1)
{
p2->next=q1->next;
q1=head;
}
else
{
q1=p3->next;
p3=q1;
}
}
}
void main()
{
struct stu *ip;
ip=creat();
turn(ip);
} |
14 | 6948 | struct stu
{
long num,ch,ma,tot;
struct stu *next;
};
int main()
{
int n,numt,cht,mat;
scanf("%d",&n);
struct stu *head,*now,*neww,*max;
int i;
for (i=1;i<=n;i++)
{
neww=(struct stu*) malloc (sizeof(struct stu));
neww->next=0;
if (i==1)
{head=neww;
now=neww;}
else
{
now->next=neww;
now=neww;
}
scanf("%ld %ld %ld",&now->num,&now->ch,&now->ma);
now->tot=now->ch + now->ma;
}
for (i=1;i<=3;i++)
{
now=head;
max=now;
while (now->next!=0)
{
if (max->tot<now->tot) max=now;
now=now->next;
}
printf("%d %d\n",max->num,max->tot);
max->tot=-1;
}
// scanf("%ld %ld %ld",&now->num,&now->ch,&now->ma);
return 0;
}
|
14 | 6949 | int main()
{
struct stu{
int chi;
int ma;
int sum;
int i;
};
struct stu m[100000],temp;
int j,n;
scanf("%d",&n);
struct stu *p=m;
struct stu *q;
for(;p<m+n;p+=1)
{
scanf("%d%d%d",&(*p).i,&(*p).chi,&(*p).ma);
(*p).sum=(*p).chi+(*p).ma;
}
for(p=m;p<m+n-1;p++)
{
for(q=p+1;q<m+n;q++)
{
if((*p).sum < (*q).sum)
{
temp=*p;
*p=*q;
*q=temp;
}
}
if(p==m+2)
break;
}// max is m[0]
for(p=m;p<m+3;p++)
{
printf("%d %d\n",(*p).i,(*p).sum);
}
return 0;
} |
14 | 6950 | struct w
{int id;
int ch;
int ma;
int sum;
struct w *next;
struct w *pre;
}*head,*p1,*p2;
int i,n,k=1,max,s=0;
struct w *make(void)
{
head=null;
scanf("%d",&n);
p1=p2=(struct w *)malloc(len);
scanf("%d %d %d",&p1->id,&p1->ch,&p1->ma);
for(k=1;k<n;k++)
{
if(k==1){head=p1;p1->pre=null;}
else {p2->next=p1;p1->pre=p2;}
p2=p1;
p1=(struct w *)malloc(len);
scanf("%d %d %d",&p1->id,&p1->ch,&p1->ma);
}
p2->next=p1;
p1->next=head;
return head;
}
void main()
{
head=make();max=0;
while(s<3)
{
max=0;
for(i=1;i<=n;i++)
{
if(i==n)p1=null;
else
{
p1->sum=p1->ch+p1->ma;
p1=p1->next;
}
}
p1=head;
for(i=1;i<=n;i++)
{
if((p1->sum)>max)
max=p1->sum;
p1=p1->next;
}
p1=head;
for(i=1;i<=n;i++)
{
p2=p1;
p1=p1->next;
if(p2->ch+p2->ma==max)
{
printf("%d %d\n",p2->id,p2->sum);
if(p2==head)
{
head=p2->next;
p2=head;
}
else
{
p2=p2->pre;
p1=p1->next;
p2->next=p1;
}
break;
}
}
s++;
}
}
|
14 | 6951 | struct student
{
long int id;
int yuwen;
int shuxue;
int total;
struct student *next;
};
long int n;
int main()
{
struct student *p0,*p1,*p2,*head,*p;
int i;
scanf ("%ld\n",&n);
p0=(struct student *)malloc(sizeof(struct student));
scanf ("%ld %d %d",&p0->id,&p0->yuwen,&p0->shuxue);
p0->total=p0->yuwen+p0->shuxue;
head=p0;p1=p0;
p0=(struct student *)malloc(sizeof(struct student));
scanf ("%ld %d %d",&p0->id,&p0->yuwen,&p0->shuxue);
p0->total=p0->yuwen+p0->shuxue;
if (p0->total<=p1->total)
{
p1->next=p0;
p1=p0;
}
else
{
head=p0;
p0->next=p1;
}
p0=(struct student *)malloc(sizeof(struct student));
scanf ("%ld %d %d",&p0->id,&p0->yuwen,&p0->shuxue);
p0->total=p0->yuwen+p0->shuxue;
if (p0->total<=p1->total)
{
p1->next=p0;
p2=p0;
}
else if (p0->total>p1->total&&p0->total<=head->total)
{
head->next=p0;
p0->next=p1;
p2=p1;
p1=p0;
}
else if (p0->total>head->total)
{
p0->next=head;
p2=p1;p1=head;head=p0;
}
p2->next=NULL;
for (i=3;i<n;i++)
{
p0=(struct student *)malloc(sizeof(struct student));
scanf ("%ld %d %d",&p0->id,&p0->yuwen,&p0->shuxue);
p0->total=p0->yuwen+p0->shuxue;
if (p0->total>p2->total)
{
if(p0->total<=p1->total)
{
p1->next=p0;
p0->next=NULL;
p2=p0;
}
else if (p0->total>p1->total&&p0->total<=head->total)
{
head->next=p0;
p0->next=p1;
p1->next=NULL;
p1=p2;p0=p1;
}
else if (p0->total>head->total)
{
p0->next=head;
p1->next=NULL;
p2=p1;p1=head;head=p0;
}
}
}
p=head;
for (i=0;i<3;i++)
{
printf("%ld %d\n",p->id,p->total);
p=p->next;
}
}
|
14 | 6952 | struct student
{
char num[10];
int yuwen;
int shuxue;
int sum;
};
int main()
{
int n,i;
scanf("%d",&n);
struct student a[100000];
struct student s[3];
struct student k;
for(i=0;i<n;i++)
{
scanf("%s %d %d",a[i].num,&a[i].yuwen,&a[i].shuxue);
a[i].sum=a[i].yuwen+a[i].shuxue;
}
s[0]=a[0];
s[1]=a[0];
s[1].sum=0;
s[2]=a[0];
s[2].sum=0;
for(i=1;i<n;i++)
{
if(a[i].sum>s[2].sum&&a[i].sum<=s[1].sum){s[2]=a[i];}
if(a[i].sum>s[1].sum&&a[i].sum<=s[0].sum){s[2]=s[1];s[1]=a[i];}
if(a[i].sum>s[0].sum) {s[2]=s[1];s[1]=s[0];s[0]=a[i];}
}
for(i=0;i<3;i++)
{
printf("%s %d\n",s[i].num,s[i].sum);
}
getchar();getchar();
}
|
14 | 6953 | struct student
{
int id;
int math_grade;
int chi_grade;
int sum;
}stu[100000];
void main()
{
int i,j,n,max,temp1,temp2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&stu[i].id);
scanf("%d",&stu[i].math_grade);
scanf("%d",&stu[i].chi_grade);
}
for(i=0;i<n;i++)
stu[i].sum=stu[i].math_grade+stu[i].chi_grade;
for(i=0;i<3;i++)
{
max=stu[i].sum;
for(j=i+1;j<n;j++)
{
if(stu[j].sum>max)
{
temp1=stu[i].id;
stu[i].id=stu[j].id;
stu[j].id=temp1;
temp2=stu[i].sum;
stu[i].sum=stu[j].sum;
stu[j].sum=temp2;
max=stu[i].sum;
}
}
}
for(i=0;i<2;i++)
printf("%d %d\n",stu[i].id,stu[i].sum);
printf("%d %d",stu[2].id,stu[2].sum);
} |
14 | 6954 | int sum[99999];
int m[99999];
int main(int argc, char* argv[])
{
int n,i,b,c,a;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a,&b,&c);
sum[i]=b+c;
m[i]=a;
}
int j,k,t,x,l=0;
for(j=0;j<n;j++)
{
for(k=n-1;k>j;k--)
{
if(sum[k]>sum[k-1])
{
t=sum[k-1];
sum[k-1]=sum[k];
sum[k]=t;
x=m[k-1];
m[k-1]=m[k];
m[k]=x;
}
}l++;
if(l==3)
break;
}
for(i=0;i<l;i++)
{
printf("%d %d\n",m[i],sum[i]);
}
return 0;
}
|
14 | 6955 | struct student
{
int num;
int score1;//????
int score2;//????
int total;
};
struct student stu[100000];
int main()
{
long i,m;
scanf("%ld",&m);
struct student *p=stu;
for(i=0;i<m;i++,p++)
{
scanf("%d%d%d",&(p->num),&(p->score1),&(p->score2));
p->total=(p->score1+p->score2);
}
int max1,max2,max3,a1=0,a2=0,a3=0;
max1=stu[0].total;
for(i=0;i<m;i++)
{
if(stu[i].total>max1) {max1=stu[i].total;a1=i;}
}
max2=stu[0].total;
for(i=0;i<m;i++)
{
if(stu[i].total>max2&&i!=a1) {max2=stu[i].total;a2=i;}
}
max3=stu[0].total;
for(i=0;i<m;i++)
{
if(stu[i].total>max3&&stu[i].total<max2) {max3=stu[i].total;a3=i;}
}
printf("%d %d\n",stu[a1].num,stu[a1].total);
printf("%d %d\n",stu[a2].num,stu[a2].total);
printf("%d %d",stu[a3].num,stu[a3].total);
return 0;
} |
14 | 6956 | int main()
{
struct Student
{
int num;
int ch;
int math;
}stu[100000];
int n,i,x=0,m=0,k=0,j,a[100000]={0};
scanf("%d",&n);
for(i=0;i<n-1;i++)
{
scanf("%d %d %d\n",&stu[i].num,&stu[i].ch,&stu[i].math);
a[i]=stu[i].ch+stu[i].math;
}
for(j=0;j<3;j++)
{
for(i=0;i<n;i++)
{
if(a[i]>m)
{
m=a[i];
x=stu[i].num;
k=i;
}
}
printf("%d %d\n",x,m); a[k]=0;
m=0;x=0;
}
return 0;
}
|
14 | 6957 | 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 | 6958 |
int main (){
int n, i, k;
struct stu{
int id;
int chn;
int math;
int total;
};
struct stu a[100001];
scanf("%d\n", &n);
for (i=0; i<n; i++){
scanf ("%d %d %d", &a[i].id, &a[i].chn, &a[i].math);
(a[i].total)=(a[i].chn)+(a[i].math);
}
for (k=1; k<5; k++){
for (i=0; i<n-k; i++){
if ((a[i].total)>=(a[i+1].total)){
a[100000].id=a[i].id;
a[100000].total=a[i].total;
a[i].id=a[i+1].id;
a[i+1].id=a[100000].id;
a[i].total=a[i+1].total;
a[i+1].total=a[100000].total;}
}
}
printf("%d %d\n", a[n-1].id, a[n-1].total);
printf("%d %d\n", a[n-2].id, a[n-2].total);
printf("%d %d\n", a[n-3].id, a[n-3].total);
return 0;
} |
14 | 6959 | 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 | 6960 |
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 | 6961 |
struct student
{
int num;
int chi;
int math;
};
int main()
{
int n,i,e=0,f=0,g=0,a=0,b=0,c=0;
scanf("%d",&n);
struct student*stu=(struct student*)malloc(sizeof(int)*3*n);
int*sz=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].chi,&stu[i].math);
sz[i]=stu[i].chi+stu[i].math;
}
for(i=0;i<n;i++)
{
if(sz[i]>sz[a])
{
a=i;
e=stu[i].num;
}
}
printf("%d %d\n",e,sz[a]);
for(i=0;i<n;i++)
{
if(i==a)
{
continue;
}
if(sz[i]>sz[b])
{
b=i;
f=stu[i].num;
}
}
printf("%d %d\n",f,sz[b]);
for(i=0;i<n;i++)
{
if(i==a||i==b)
{
continue;
}
if(sz[i]>sz[c])
{
c=i;
g=stu[i].num;
}
}
printf("%d %d",g,sz[c]);
free(sz);
return 0;
} |
14 | 6962 | struct student
{
int num;
int yuwen;
int shuxue;
int total;
}stu[100000];
void main()
{
int n,i,j,k;
struct student temp;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{scanf("%d%d%d",&stu[i].num,&stu[i].yuwen,&stu[i].shuxue);
stu[i].total=stu[i].yuwen+stu[i].shuxue;}
for(i=0;i<n-1;i++)
{
k=i;
for(j=i+1;j<n;j++)
{if(stu[j].total>stu[i].total)
{k=j;
temp=stu[k];stu[k]=stu[i];stu[i]=temp;}
}if(i==3)break;
}
for(i=0;i<3;i++)
printf("%d %d\n",stu[i].num,stu[i].total);
} |
14 | 6963 | struct student
{ int id;
int a;
int b;
int zong;
};
struct student ren[100000];
int main()
{int n,i,fen,flag=0,j;
scanf("%d\n",&n);
for(i=0;i<=n-1;i++)
{ scanf("%d",&ren[i].id);
scanf("%d",&ren[i].a);
scanf("%d",&ren[i].b);
ren[i].zong=ren[i].a+ren[i].b;
}
for(fen=200;fen>=100;fen--)
{ for(i=0;i<=n-1;i++)
if(fen==ren[i].zong)
{printf("%d %d\n",ren[i].id,ren[i].zong);
flag=flag+1;
if(flag==3)goto end;
}
}
end:
getchar();
} |
14 | 6964 | 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 | 6965 |
struct student
{
char id[10];
int ch;
int ma;
};
int main(int argc, char* argv[])
{
int n,i,max,sec,min,total[100000];
scanf("%d",&n);
struct student stu[100000];
for(i=0;i<n;i++)
{
scanf("%s%d%d",stu[i].id, &stu[i].ch, &stu[i].ma);
total[i]=stu[i].ch + stu[i].ma;
}
max = 0;
for(i=0;i<n;i++)
{
if(total[i]>total[max])
max = i;
}
printf("%s %d\n",stu[max].id, total[max]);
for(i=0;i<n;i++)
{
if(total[i]==total[max])
{
total[i]=0;
break;
}
}
sec = 0;
for(i=0;i<n;i++)
{
if(total[i]>total[sec])
sec=i;
}
printf("%s %d\n", stu[sec].id, total[sec]);
for(i=0;i<n;i++)
{
if(total[i]==total[sec])
{
total[i]=0;
break;
}
}
min = 0;
for(i=0;i<n;i++)
{
if(total[i]>total[min])
min=i;
}
printf("%s %d\n", stu[min].id, total[min]);
return 0;
}
|
14 | 6966 | 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 | 6967 | struct stu
{
int a;
int b;
int c;
int d;
};
void main()
{
int i,j,n,t;
struct stu *p1,p2;
scanf("%d",&n);
p1=(struct stu*)calloc(n,sizeof(struct stu));
for(i=0;i<n;i++)
{
scanf("%d %d %d",&(p1[i].a),&(p1[i].b),&(p1[i].c));
p1[i].d=p1[i].b+p1[i].c;
}
for(i=0;i<3;i++)
for(j=i+1;j<n;j++)
if(p1[i].d<p1[j].d)
{
p2=p1[i];
p1[i]=p1[j];
p1[j]=p2;
}
for(i=0;i<3;i++)
printf("%d %d\n",p1[i].a,p1[i].d);
}
|
14 | 6968 | struct stu
{
int id;
int sum;
struct stu *next;
};
void main()
{
struct stu *head,*p1,*p2,*p0;
int n,i,ch,ma,len;
scanf("%d",&n);
len = sizeof (struct stu);
p1 = p2 = (struct stu*)malloc(len);
head = p1;
scanf("%d%d%d",&p1->id,&ch,&ma);
p1->sum = ch + ma;
p1->next = 0;
for (i=2;i<=n;i++)
{
p0 = (struct stu*)malloc(len);
scanf("%d %d %d",&p0->id,&ch,&ma);
p0->sum = ch + ma;
p1=p2=head;
while ( (p0->sum <= p1->sum) && (p1->next != 0) )
{
p2 = p1;
p1 = p1->next;
}
if (p0->sum > p1->sum)
{
if (head == p1)
head = p0;
else p2->next = p0;
p0->next = p1;
}
else
{
p1->next = p0;
p0->next = 0;
}
if (i>3)
{
p1 = head->next;
p1 = p1->next;
p1->next = 0;
}
}
p1 = head;
while (p1!=0)
{
printf("%d %d\n",p1->id,p1->sum);
p1 = p1->next;
}
}
|
14 | 6969 | int main()
{
struct student
{
int num;
int scorechinese;
int scoremath;
int sum;
}a[100000];
int n,i,j,temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&a[i].num,&a[i].scorechinese,&a[i].scoremath);
a[i].sum=a[i].scorechinese+a[i].scoremath;
}
for(i=0;i<3;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i].sum<a[j].sum)
{
temp=a[i].sum,a[i].sum=a[j].sum,a[j].sum=temp;
temp=a[i].num,a[i].num=a[j].num,a[j].num=temp;
}
}
printf("%d %d\n",a[i].num,a[i].sum);
}
return 0;
}
|
14 | 6970 | struct Student
{
int id;
int c;
int m;
int sum;
};
void main()
{
struct Student temp,s1,s2,s3;
int i,n;
s1.sum=s2.sum=s3.sum=-1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&temp.id,&temp.c,&temp.m);
temp.sum=temp.c+temp.m;
if(temp.sum>s1.sum)
{
s3=s2;
s2=s1;
s1=temp;
}
else if (temp.sum>s2.sum)
{
s3=s2;
s2=temp;
}
else if(temp.sum>s3.sum)
{
s3=temp;
}
}
printf("%d %d\n%d %d\n%d %d\n",s1.id,s1.sum,s2.id,s2.sum,s3.id,s3.sum);
}
|
14 | 6971 | int main(){
int n,i,max1=0,num1=0,max2=0,num2=0,max3=0,num3=0;
struct stu{
int num;
int chn;
int mat;
int sum;
}sco[100000];
cin>>n;
for(i=0;i<n;i++){
cin>>sco[i].num>>sco[i].chn>>sco[i].mat;
sco[i].sum=sco[i].chn+sco[i].mat;
}
for(i=0;i<n;i++){
if(sco[i].sum>max1){
max3=max2;
num3=num2;
max2=max1;
num2=num1;
max1=sco[i].sum;
num1=i;
}
else{
if(sco[i].sum>max2){
max3=max2;
num3=num2;
max2=sco[i].sum;
num2=i;
}
else {
if(sco[i].sum>max3){
max3=sco[i].sum;
num3=i;
}
}
}
}
cout<<num1+1<<' '<<max1<<endl;
cout<<num2+1<<' '<<max2<<endl;
cout<<num3+1<<' '<<max3<<endl;
return 0;
}
|
14 | 6972 | 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 | 6973 | int main()
{
int n;
scanf ("%d",&n);
struct student
{
int num;
int chinese;
int maths;
};
struct student a[100000],temp;
int i,b[100000]={0};
for (i=0;i<n;i++)
{
scanf("%d",&a[i].num);
scanf("%d",&a[i].chinese);
scanf("%d",&a[i].maths);
}
for (i=1;i<n;i++)
{
if ((a[i].chinese+a[i].maths)>(a[0].chinese+a[0].maths))
{
temp=a[0];
a[0]=a[i];
a[i]=temp;
}
}
printf("%d %d\n",a[0].num,a[0].chinese+a[0].maths);
for (i=2;i<n;i++)
{
if ((a[i].chinese+a[i].maths)>(a[1].chinese+a[1].maths))
{
temp=a[1];
a[1]=a[i];
a[i]=temp;
}
}
printf("%d %d\n",a[1].num,a[1].chinese+a[1].maths);
for (i=3;i<n;i++)
{
if ((a[i].chinese+a[i].maths)>(a[2].chinese+a[2].maths))
{
temp=a[2];
a[2]=a[i];
a[i]=temp;
}
}
printf("%d %d\n",a[2].num,a[2].chinese+a[2].maths);
return 0;
} |
14 | 6974 | struct data
{
long int num;
int point1;
int point2;
int sum;
struct data*next;
};
struct data*creat(long int n)
{
long int i=0;
struct data*p1,*p2,*head;
p1=p2=(struct data*)malloc(sizeof(struct data));
scanf("%ld %d %d",&p1->num,&p1->point1,&p1->point2);
p1->sum=p1->point1+p1->point2;
head=NULL;
while(i<n)
{
i=i+1;
if(i==1) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct data*)malloc(sizeof(struct data));
scanf("%ld %d %d",&p1->num,&p1->point1,&p1->point2);
p1->sum=p1->point1+p1->point2;
}
p2->next=NULL;
return(head);
}
struct data*max(struct data*head)
{
struct data *p1,*max;
max=head;
p1=head;
do
{
if(p1->sum>max->sum) max=p1;
p1=p1->next;
}while(p1!=NULL);
return(max);
}
struct data*del(struct data*head,struct data*max)
{
struct data *p1,*p2;
p1=head;
while(max!=p1)
{
p2=p1;
p1=p1->next;
}
if(p1==head)
head=p1->next;
else
{
p2->next=p1->next;
}
return(head);
}
void main()
{
struct data*a,*b,*c,*head;
long int n;
scanf("%ld",&n);
head=creat(n);
a=max(head);
printf("%ld %d\n",a->num,a->sum);
head=del(head,a);
b=max(head);
printf("%ld %d\n",b->num,b->sum);
c=max(del(head,b));
printf("%ld %d\n",c->num,c->sum);
} |
14 | 6975 |
typedef struct
{
int ID;
int chinese;
int math;
int sum;
}Student;
Student topThree[3];
int studentNum;
void initialise()
{
for(int i = 0; i < 3; i ++)
{
topThree[i].sum = -1;
}
}
void updateTopThree(Student stu)
{
for(int i = 0; i < 3; i ++)
{
if(stu.sum > topThree[i].sum)
{
for(int j = 2; j > i; j --)
{
topThree[j] = topThree[j-1];
}
topThree[i] = stu;
break;
}
}
}
void getStudentData()
{
Student temp;
scanf("%d", &studentNum);
for(int i = 0; i < studentNum; i ++)
{
scanf("%d %d %d", &temp.ID, &temp.chinese, &temp.math);
temp.sum = temp.chinese + temp.math;
updateTopThree(temp);
}
}
void printStudentData()
{
for(int i = 0; i < 3 && i < studentNum; i ++)
{
printf("%d %d\n", topThree[i].ID, topThree[i].sum);
}
}
int main()
{
initialise();
getStudentData();
printStudentData();
return 0;
}
|
14 | 6976 | struct Student
{
int num;
int chn;
int mth;
int sum;
};
struct Scr
{
int num;
int sum;
};
int main()
{
struct Student stu[100000];
struct Scr scr[3];
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[i].num,&stu[i].chn,&stu[i].mth);
stu[i].sum=stu[i].chn+stu[i].mth;
}
scr[0].num=stu[0].num;
scr[0].num=stu[0].num;
for(i=1;i<n;i++)
{
if(stu[i].sum>scr[0].sum)
{
scr[0].num=stu[i].num;
scr[0].sum=stu[i].sum;
}
}
scr[1].num=stu[0].num;
scr[1].num=stu[0].num;
for(i=1;i<n;i++)
{
if(i!=scr[0].num-1)
{
if(stu[i].sum>scr[1].sum)
{
scr[1].num=stu[i].num;
scr[1].sum=stu[i].sum;
}
}
}
scr[2].num=stu[0].num;
scr[2].num=stu[0].num;
for(i=1;i<n;i++)
{
if(i==scr[0].num-1||i==scr[1].num-1)
continue;
else
{
if(stu[i].sum>scr[2].sum)
{
scr[2].num=stu[i].num;
scr[2].sum=stu[i].sum;
}
}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",scr[i].num,scr[i].sum);
}
return 0;
}
|
14 | 6977 | struct stu
{
int num;
int chi;
int math;
int s;
struct stu *next;
};
struct stu *creat(int n)
{
int i;
struct stu *head;
struct stu *p1,*p2;
p1=p2=(struct stu *)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->chi,&p1->math);
head=p1;
for(i=1;i<n;i++)
{
p1=(struct stu*)malloc(sizeof(struct stu));
scanf("%d %d %d",&p1->num,&p1->chi,&p1->math);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return (head);
}
void main()
{
int i,n,t,m;
struct stu *head,*p1,*p2;
scanf("%d",&n);
head=creat(n);
p1=head;
for(i=0;i<n;i++)
{
p1->s=p1->chi+p1->math;
p1=p1->next;
}
p1=head;
p2=p1->next;
for(i=0;i<3;i++)
{
while(p2!=NULL)
{
if(p2->s>p1->s)
{
t=p2->s;
p2->s=p1->s;
p1->s=t;
m=p2->num;
p2->num=p1->num;
p1->num=m;
}p2=p2->next;
}printf("%d %d\n",p1->num,p1->s);
if(i==2)break;
p1=p1->next;p2=p1->next;
}
} |
14 | 6978 |
struct student
{
int num;
int chinese;
int math;
int total;
};
int main()
{
int n;
scanf("%d",&n);
struct student *stu=(struct student *)malloc(sizeof(int)*4*n);
int i;
for(i=0;i<n;i++){
scanf("%d%d%d",&stu[i].num,&stu[i].chinese,&stu[i].math);
}
for(i=0;i<n;i++){
stu[i].total=stu[i].chinese+stu[i].math;
}
int t_1,t_2;
int j,k;
for(k=1;k<4;k++){
for(j=0;j<n-k;j++){
if(stu[j].total>=stu[j+1].total){
t_1=stu[j+1].total;
stu[j+1].total=stu[j].total;
stu[j].total=t_1;
t_2=stu[j+1].num;
stu[j+1].num=stu[j].num;
stu[j].num=t_2;
}
}
}
for(i=n-1;i>n-4;i--){
printf("%d %d\n",stu[i].num,stu[i].total);
}
return 0;
}
|
14 | 6979 | int main()
{
int n,i;
int o=0,oz,t=0,tz,th=0;
scanf("%d",&n);
struct{
int h,z;
}s[100000];
for(i=0;i<n;i++)
{
int h0,x0,y0;
scanf("%d%d%d",&h0,&x0,&y0);
s[i].h=h0;
s[i].z=x0+y0;
}
for(i=0;i<n;i++)
if(s[i].z>o)
o=s[i].z;
for(i=0;i<n;i++)
if(s[i].z==o)
{
oz=i;
printf("%d %d\n",s[i].h,s[i].z);
break;
}
for(i=0;i<n;i++)
if((i!=oz)&&(s[i].z>t))
t=s[i].z;
for(i=0;i<n;i++)
if((i!=oz)&&(s[i].z==t))
{
tz=i;
printf("%d %d\n",s[i].h,s[i].z);
break;
}
for(i=0;i<n;i++)
if((i!=oz)&&(i!=tz)&&(s[i].z>th))
th=s[i].z;
for(i=0;i<n;i++)
if((i!=oz)&&(i!=tz)&&(s[i].z==th))
{
printf("%d %d\n",s[i].h,s[i].z);
break;
}
return 0;
}
|
14 | 6980 | struct student
{
long int num;
int Chinese;
int Maths;
int total;
};
void main()
{
struct student stu[100000];
struct student tempt;
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&stu[i].num,&stu[i].Chinese,&stu[i].Maths);
stu[i].total=stu[i].Chinese+stu[i].Maths;
}
if(stu[2].total>stu[1].total){
tempt=stu[1];
stu[1]=stu[2];
stu[2]=tempt;
}
if(stu[1].total>stu[0].total){
tempt=stu[0];
stu[0]=stu[1];
stu[1]=tempt;
}
if(stu[2].total>stu[1].total){
tempt=stu[1];
stu[1]=stu[2];
stu[2]=tempt;
}
for(i=3;i<n;i++){
if(stu[i].total>stu[2].total){
stu[2]=stu[i];
if(stu[2].total>stu[1].total){
tempt=stu[1];
stu[1]=stu[2];
stu[2]=tempt;
if(stu[1].total>stu[0].total){
tempt=stu[0];
stu[0]=stu[1];
stu[1]=tempt;
}
}
}
}
printf("%d %d\n",stu[0].num,stu[0].total);
printf("%d %d\n",stu[1].num,stu[1].total);
printf("%d %d\n",stu[2].num,stu[2].total);
} |
14 | 6981 | int main()
{
struct stu{
int ID,chin,math;
};
stu *pp;
int sum,second,third,x,y,z;
int i,n;
int a,b,c;
scanf("%d",&n);
pp=(struct stu *)malloc(sizeof(stu)*n);
for(i=1;i<=n;i++)
{
scanf("%d %d %d",&a,&b,&c);
(pp+i)->ID=a;
(pp+i)->chin=b;
(pp+i)->math=c;
}
sum = ((pp+i)->chin)+((pp+i)->math);
for(i=1;i<=n;i++)
{
if(i==1)
{
sum=((pp+i)->chin)+((pp+i)->math);
second=((pp+i)->chin)+((pp+i)->math);
third=((pp+i)->chin)+((pp+i)->math);
x=(pp+i)->ID;
y=(pp+i)->ID;
z=(pp+i)->ID ;
}
else if (i==2)
{
if (sum<((pp+i)->chin)+((pp+i)->math))
{
second=sum;
sum=((pp+i)->chin)+((pp+i)->math);
y=x;
x=(pp+i)->ID;
}
else
{
third=((pp+i)->chin)+((pp+i)->math);
z=(pp+i)->ID;
}
}
else
{
if (sum<((pp+i)->chin)+((pp+i)->math))
{
third=second;
second=sum;
sum=((pp+i)->chin)+((pp+i)->math);
z=y;
y=x;
x=(pp+i)->ID;
}
else if (second<((pp+i)->chin)+((pp+i)->math))
{
third=second;
second=((pp+i)->chin)+((pp+i)->math);
z=y;
y=(pp+i)->ID;
}
else if (third<((pp+i)->chin)+((pp+i)->math))
{
third=((pp+i)->chin)+((pp+i)->math);
z=(pp+i)->ID;
}
}
}
printf("%d %d\n",x,sum);
printf("%d %d\n",y,second);
printf("%d %d\n",z,third);
return 0;
} |
14 | 6982 | struct student
{
int num;
float yuwen;
float shuxue;
float total;
}stu[100000];
void main()
{
int i,n,j;
struct student *p;
p=&stu[0];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%f%f",&(p+i)->num,&(p+i)->yuwen,&(p+i)->shuxue);
(p+i)->total=(p+i)->shuxue+(p+i)->yuwen;
}
for(i=0;i<3;i++)
for(j=0;j<n-1-i;j++)
{
if((*(p+j)).total>=(*(p+j+1)).total)
{
struct student temp;
temp=*(p+j+1);
*(p+j+1)=*(p+j);
*(p+j)=temp;
}
}
if(n>2)
for(i=1;i<4;i++)
printf("%d %g\n",(*(p+n-i)).num,(*(p+n-i)).total);
else if(n=2)
printf("%d %g\n%d %g\n",(*(p+1)).num,(*(p+1)).total,(*p).num,(*p).total);
}
|
14 | 6983 | struct Student
{
int num;
int chinese;
int maths;
};
struct qiansan
{
int num;
int zongfen;
}st[3]={{0,0},{0,0},{0,0}};
main()
{
int n,i,k,c[10],j[10];
int a[100001];
scanf("%d",&n);
struct Student std[100001];
for(i = 0;i < n;i++)
{
scanf("%d %d %d",&std[i].num,&std[i].chinese,&std[i].maths);
}
for(i = 0;i < n;i++)
{
a[i] = std[i].chinese + std[i].maths;
}
for(i = 0;i < n;i++)
{
if(a[i]>st[0].zongfen)
{
st[2]=st[1];
st[1]=st[0];
st[0].zongfen=a[i];
st[0].num=std[i].num;
}
else if(a[i] <= st[0].zongfen && a[i] > st[1].zongfen)
{
st[2]=st[1];
st[1].zongfen=a[i];
st[1].num=std[i].num;
}
else if(a[i] <= st[1].zongfen && a[i]>st[2].zongfen)
{
st[2].zongfen=a[i];
st[2].num=std[i].num;
}
}
for(i = 0;i < 3;i++)
{
printf("%d %d\n",st[i].num,st[i].zongfen);
}
getchar();
getchar();
}
|
14 | 6984 | int main()
{
struct student
{
int ID;
int yuwen;
int shuxue;
};
int n,i,x,y,z,o,p,q;
scanf("%d",&n);
int a[100000];
struct student stu[100000];
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].ID,&stu[i].yuwen,&stu[i].shuxue);
a[i]=stu[i].yuwen+stu[i].shuxue;
}
x=0;
y=1;
z=2;
for(i=0;i<3;i++)
{
if(a[i]>=a[0]&&a[i]>=a[1]&&a[i]>=a[2])
{
x=i;
o=a[i];
continue;
}
if(a[i]<=a[0]&&a[i]<=a[1]&&a[i]<=a[2])
{
z=i;
q=a[i];
continue;
}
y=i;
p=a[i];
}
for(i=3;i<n;i++)
{
if(a[i]>q)
{
if(a[i]>o)
{
z=y;
y=x;
x=i;
q=p;
p=o;
o=a[i];
}
else
{
if(a[i]>p)
{
z=y;
y=i;
q=p;
p=a[i];
}
else
{
z=i;
q=a[i];
}
}
}
}
printf("%d %d\n",stu[x].ID,o);
printf("%d %d\n",stu[y].ID,p);
printf("%d %d\n",stu[z].ID,q);
getchar();
getchar();
}
|
14 | 6985 | struct student
{ int num;int a;int b;int sum;int c;};
void main()
{
int n,i,j,nt,ct;
struct student stu[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%d %d %d",&stu[i].num,&stu[i].a,&stu[i].b);
stu[i].sum=stu[i].a+stu[i].b;stu[i].c=stu[i].sum;}
for(i=0;i<3;i++)
for(j=i+1;j<n;j++)
{
if(stu[i].c<stu[j].c){
nt=stu[i].num;stu[i].num=stu[j].num;stu[j].num=nt;
ct=stu[i].c;stu[i].c=stu[j].c;stu[j].c=ct;
}
}
for(i=0;i<3;i++)
printf("%d %d\n",stu[i].num,stu[i].c);
}
|
14 | 6986 | struct student
{
long a;
int x;
int y;
};
struct student stu[100000];
main()
{
long n,i,j,p;
int m;
scanf("%ld",&n);
int g[100000];
for(i=0;i<n;i++)
{
scanf("%ld %d %d",&stu[i].a,&stu[i].x,&stu[i].y);
g[i]=stu[i].x+stu[i].y;
}
for(i=1;i<4;i++)
for(j=n-1;j>=i;j--)
if(g[j-1]<g[j])
{
m=g[j-1];g[j-1]=g[j];g[j]=m;
p=stu[j-1].a;stu[j-1].a=stu[j].a;stu[j].a=p;
}
for(i=0;i<3;i++)
printf("%ld %d\n",stu[i].a,g[i]);
}
|
14 | 6987 | struct
{
int xuehao;
int yuwen;
int shuxue;
}student[1000000];
void swap(int*a,int*b);
int main(int argc, char* argv[])
{
int n=0;
scanf("%d",&n);
int i=0,j=0,total[1000000];
for(i=0;i<n;i++)
{
scanf("%d%d%d",&student[i].xuehao,&student[i].yuwen,&student[i].shuxue);
total[i]=student[i].yuwen+student[i].shuxue;
}
for(i=0;i<3;i++)
{
for(j=n-1;j>0+i;j--)
{
if(total[j]>total[j-1])
{
swap(&total[j],&total[j-1]);
swap(&student[j-1].xuehao,&student[j].xuehao);
swap(&student[j-1].yuwen,&student[j].yuwen);
swap(&student[j-1].shuxue,&student[j].shuxue);
}
}
}
for(i=0;i<3;i++)
{
printf("%d %d\n",student[i].xuehao,total[i]);
}
return 0;
}
void swap(int*a,int*b)
{
int e;
e=*a;
*a=*b;
*b=e;
} |
14 | 6988 | struct student
{
int id;
int chinese;
int math;
}stu[100000];
void bubble(struct student stu[],int n)
{
int pass,i;
struct student temp;
for(pass=n-1;pass>=n-3;pass--)
for(i=pass;i>0;i--)
if(stu[i].chinese+stu[i].math>stu[i-1].chinese+stu[i-1].math)
{
temp=stu[i];
stu[i]=stu[i-1];
stu[i-1]=temp;
}
}
int main()
{
struct student *p;
int i;
int n;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d",&stu[i].id,&stu[i].chinese,&stu[i].math);
bubble(stu,n);
for(p=stu;p<stu+3;p++)
printf("%d %d%c",p->id,p->chinese+p->math,(p==stu+n-1)?'\0':'\n');
return 0;
} |
14 | 6989 | struct student
{
int num;
int score1;
int score2;
int sum;
struct student *next;
};
struct student *creat(int m)
{
int i=0;
struct student *head,*p1,*p2;
p1=p2=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->score1,&p1->score2);
p1->sum=(p1->score1)+(p1->score2);
head=NULL;
for(i=0;i<m-1;i++)
{
if(i==0) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%d %d %d",&p1->num,&p1->score1,&p1->score2);
p1->sum=(p1->score1)+(p1->score2);
}
p2->next=p1;
p1->next=NULL;
return(head);
}
void print(struct student *head)
{
struct student *p=head,*q=head;
int a=0,b=0,c=0;
if(head!=NULL)
{do
{
if(a<p->sum)
{a=p->sum;q=p;}
p=p->next;
}while(p!=NULL);
printf("%d %d\n",q->num,q->sum);
q->sum=0;
p=head;q=head;
do
{if(b<p->sum)
{b=p->sum;q=p;}
p=p->next;
}while(p!=NULL);
printf("%d %d\n",q->num,q->sum);
q->sum=0;
p=head;q=head;
do
{if(c<p->sum)
{c=p->sum;q=p;}
p=p->next;
}while(p!=NULL);
printf("%d %d",q->num,q->sum);
}
}
void main()
{
int m;
scanf("%d",&m);
struct student *head,stu;
head=creat(m);
print(head);
} |
14 | 6990 | struct s
{long int a;
int b;
int c;
int sum;
struct s *next;};
void main()
{struct s *head1,*head2;
struct s *p,*p1,*p2,*p3,*p4;
long int n,i;
int rank1,rank2,rank3;
scanf("%ld",&n);
p1=(struct s *)malloc(L);
scanf("%ld %d %d",&p1->a,&p1->b,&p1->c);
p1->sum=p1->b+p1->c;
rank1=p1->sum;
for(i=1;;i++)
{if(i==1) head1=p1;
else p2->next=p1;
p2=p1;
if(i==n) break;
p1=(struct s *)malloc(L);
scanf("%ld %d %d",&p1->a,&p1->b,&p1->c);
p1->sum=p1->b+p1->c;
if(p1->sum>rank1) rank1=p1->sum;}
p2->next=N;
p1=head1;
while(rank1!=p1->sum)
{p2=p1;p1=p1->next;}
if(rank1==p1->sum)
{if(p1==head1) head1=p1->next;
else p2->next=p1->next;
p3=p1;}
head2=p3;
p4=p3;
p1=head1;
rank2=p1->sum;
while(p1!=N)
{if(p1->sum>rank2) rank2=p1->sum;
p1=p1->next;}
p1=head1;
while(rank2!=p1->sum)
{p2=p1;p1=p1->next;}
if(rank2==p1->sum)
{if(p1==head1) head1=p1->next;
else p2->next=p1->next;
p3=p1;}
p4->next=p3;
p4=p3;
p1=head1;
rank3=p1->sum;
while(p1!=N)
{if(p1->sum>rank3) rank3=p1->sum;
p1=p1->next;}
p1=head1;
while(rank3!=p1->sum)
{p2=p1;p1=p1->next;}
if(rank3==p1->sum)
{if(p1==head1) head1=p1->next;
else p2->next=p1->next;
p3=p1;}
p4->next=p3;
p3->next=N;
p=head2;
do{printf("%ld %d\n",p->a,p->sum);
p=p->next;}while(p!=N);
}
|
14 | 6991 | struct student
{
int name;
int ch;
int math;
};
struct student stu[100000];
int main()
{
int n; int sum[100000];int max[3];int i,j,k,m,o;int s;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d",&stu[i].name,&stu[i].ch,&stu[i].math);
for(i=0;i<n;i++)
{
sum[i]=stu[i].ch+stu[i].math;
}
//for(i=0;i<n;i++)
{
max[0]=0;
for(j=0,k=0;j<n;j++)
{if(sum[j]>max[0])
{max[0]=sum[j];
k=j;}
}
}
//for(i=0;i<n;i++)
{
max[1]=0;
for(j=1,m=0;j<n;j++)
{if((sum[j]>max[1])&&(j!=k))
{max[1]=sum[j];
m=j;}
}
}
//for(i=0;i<n;i++)
{
max[2]=0;
for(j=1,o=0;j<n;j++)
{if((sum[j]>max[2])&&(j!=k)&&(j!=m))
{max[2]=sum[j];
o=j;}
}
}
printf("%d %d\n",stu[k].name,sum[k]);
printf("%d %d\n",stu[m].name,sum[m]);
printf("%d %d\n",stu[o].name,sum[o]);
return 0;
} |
14 | 6992 | 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 | 6993 | int main(){
int n;
cin>>n;
struct stu{
int num;
int chin;
int math;
int sum;
}one[n+1];
for(int i=1;i<=n;i++){
cin>>one[i].num>>one[i].chin>>one[i].math;
one[i].sum=one[i].chin+one[i].math;
} //???????
int t=0;
for(int i=200;i>=0;i--)
for(int j=1;j<=n;j++){
if (one[j].sum==i) {
cout<<j<<" "<<one[j].sum<<endl;
t=t+1;
}
if (t==3) {
i=-1;break;
}
}//????????
return 0;
} |
14 | 6994 | int main()
{
struct stu
{
int a,b,c;
struct stu *next;
struct stu *back;
};
struct stu *head,*p1,*p2,*p,*pmax1,*pmax2,*pmax3;
int n,i,j,max1,max2,max3;
scanf("%d",&n);
p1=p2=(struct stu *)malloc(sizeof(struct stu));
scanf("%d %d %d",&p1->a,&p1->b,&p1->c);
head=p1;
for(i=1;i<n;i++)
{
p1=(struct stu *)malloc(sizeof(struct stu));
p2->next=p1;
p1->back=p2;
p2=p1;
scanf("%d %d %d",&p1->a,&p1->b,&p1->c);
}
p=head;
max1=0;
for (i=0;i<n;i++)
{
if (max1<(p->b+p->c))
{
max1=p->b+p->c;
pmax1=p;
}
p=p->next;
}
p=head;
max2=0;
for (i=0;i<n;i++)
{
if (max2<(p->b+p->c)&&(p!=pmax1))
{
max2=p->b+p->c;
pmax2=p;
}
p=p->next;
}
p=head;
max3=0;
for (i=0;i<n;i++)
{
if (max3<(p->b+p->c)&&(p!=pmax1)&&(p!=pmax2))
{
max3=p->b+p->c;
pmax3=p;
}
p=p->next;
}
printf("%ld %d\n",pmax1->a,(pmax1->b+pmax1->c));
printf("%ld %d\n",pmax2->a,(pmax2->b+pmax2->c));
printf("%ld %d\n",pmax3->a,(pmax3->b+pmax3->c));
return 0;
} |
14 | 6995 | struct stud {
int id;
float langrade;
float mathgrade;
} student[100000],s;
int student_num;
float total[100000],t;
void trisort(){
for(int i=0;i<2;i++)
for(int j=0;j<2-i;j++)
if(total[j]<total[j+1]){
t=total[j];
s=student[j];
total[j]=total[j+1];
student[j]=student[j+1];
total[j+1]=t;
student[j+1]=s;
}
}
int main(){
int i,j;
cin>>student_num;
for(i=0;i<student_num;i++){
cin>>student[i].id>>student[i].langrade>>student[i].mathgrade;
total[i]=student[i].langrade+student[i].mathgrade;}
for(j=3;j<student_num;j++)
{trisort();
if(total[j]>total[2]){
t=total[2];
s=student[2];
total[2]=total[j];
student[2]=student[j];
total[j]=t;
student[j]=s;
}
}
for(i=0;i<3;i++)
cout<<student[i].id<<" "<<total[i]<<endl;
return 0;
}
|
14 | 6996 | struct student
{
long num;
int scorec;
int scorem;
struct student *next;
};
struct student *creat(void)
{
struct student *head,*p0,*p1,*p2;
int i=0;
head=(struct student *)malloc(len);
head->next=NULL;
scanf("%ld %d %d",&head->num,&head->scorec,&head->scorem);
while(i<2)
{
p1=head;
p0=(struct student *)malloc(len);
scanf("%ld %d %d",&p0->num,&p0->scorec,&p0->scorem);
while((p0->scorec+p0->scorem)<=(p1->scorec+p1->scorem)&&(p1->next!=NULL))
{
p2=p1;
p1=p1->next;
}
if((p0->scorec+p0->scorem)>(p1->scorec+p1->scorem))
{
if(head==p1) head=p0;
else p2->next=p0;
p0->next=p1;
}
else
{
p1->next=p0;
p0->next=NULL;
}
i++;
}
return(head);
}
struct student *sort(struct student *head,int n)
{
struct student *p0,*p1,*p2;
int i=3;
while(i<n)
{
p1=head;
p0=(struct student*)malloc(len);
scanf("%ld %d %d",&p0->num,&p0->scorec,&p0->scorem);
while((p0->scorec+p0->scorem)<=(p1->scorec+p1->scorem)&&(p1->next!=NULL))
{
p1=p1->next;
}
if((p0->scorec+p0->scorem)>(p1->scorec+p1->scorem))
{
if(head==p1)
{
p2=p1->next;
(*p2->next).num=p2->num;
(*p2->next).scorec=p2->scorec;
(*p2->next).scorem=p2->scorem;
p2->num=p1->num;
p2->scorec=p1->scorec;
p2->scorem=p1->scorem;
p1->num=p0->num;
p1->scorec=p0->scorec;
p1->scorem=p0->scorem;
}
else if(p1==head->next)
{
(*p1->next).num=p1->num;
(*p1->next).scorec=p1->scorec;
(*p1->next).scorem=p1->scorem;
p1->num=p0->num;
p1->scorec=p0->scorec;
p1->scorem=p0->scorem;
}
else
{
p1->num=p0->num;
p1->scorec=p0->scorec;
p1->scorem=p0->scorem;
}
}
free(p0);
i++;
}
return(head);
}
void main()
{
struct student *head,*p1,*p2;
int n;
scanf("%d",&n);
head=creat();
head=sort(head, n);
p1=head->next;
p2=p1->next;
printf("%ld %d\n",head->num,(head->scorec+head->scorem));
printf("%ld %d\n",p1->num,(p1->scorec+p1->scorem));
printf("%ld %d",p2->num,(p2->scorec+p2->scorem));
} |
14 | 6997 |
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 | 6998 | struct student
{
int num;
int yuwen;
int shuxue;
};
int main()
{
int n,m,i,j,t,k;
scanf("%d",&n);
m=n;
struct student *stu=(struct student*)malloc(sizeof(struct student)*n);
int *score=(int*)malloc(sizeof(int)*m);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&stu[i].num,&stu[i].yuwen,&stu[i].shuxue);
score[i]=stu[i].yuwen+stu[i].shuxue;
}
for(i=0;i<3;i++)
{
for(j=0;j<m-1-i;j++)
{
if(score[j]>=score[j+1])
{
t=score[j];
score[j]=score[j+1];
score[j+1]=t;
k=stu[j].num;
stu[j].num=stu[j+1].num;
stu[j+1].num=k;
}
}
}
for(i=n-1;i>=n-3;i--)
{
printf("%d %d\n",stu[i].num,score[i]);
}
free(stu);
free(score);
return 0;
} |
14 | 6999 | struct student
{
int num;
int s1;
int s2;
int sum;
};
struct student stu[100000];
int main()
{
int n,i,p,q,r,max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&stu[i].num,&stu[i].s1,&stu[i].s2);
stu[i].sum=stu[i].s1+stu[i].s2;
}
max=0;
for(i=0;i<n;i++)
{
if(stu[i].sum>max)
{
max=stu[i].sum;
p=i;
}
}
max=0;
for(i=0;i<n;i++)
{
if(i!=p)
{
if(stu[i].sum>max)
{
max=stu[i].sum;
q=i;
}
}
}
max=0;
for(i=0;i<n;i++)
{
if((i!=p)&&(i!=q))
{
if(stu[i].sum>max)
{
max=stu[i].sum;
r=i;
}
}
}
printf("%d %d\n",stu[p].num,stu[p].sum);
printf("%d %d\n",stu[q].num,stu[q].sum);
printf("%d %d\n",stu[r].num,stu[r].sum);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.