问题 E: C语言11.8

#include<cstdio>
#include<algorithm>
using namespace std;
double mark1=0,mark2=0,mark3=0;
struct student{
	int num;
	char name[20];
	int mark1;
	int mark2;
	int mark3;
	double mean;
}stu[10],*p=stu; 
int max=-99999999;
int k;
bool cmp(student a,student b){
	if(a.mean==b.mean)
		return a.num>b.num;
	else 
		return a.mean>b.mean;
	
}
void input(){
	for(int i=0;i<10;i++){
		scanf("%d %s %d %d %d",&(p+i)->num,(p+i)->name,&(p+i)->mark1,&(p+i)->mark2,&(p+i)->mark3);
		(p+i)->mean =((p+i)->mark1+(p+i)->mark2+(p+i)->mark3)/3;
	}
}
void deal(){
	for(int i=0;i<10;i++){
	mark1 +=(p+i)->mark1;
	mark2 +=(p+i)->mark2;
	mark3 +=(p+i)->mark3;
	}
	mark1 /=10;mark2 /=10;mark3 /=10;
	sort(stu,stu+10,cmp);
}
void output(){
	printf("%.2f %.2f %.2f\n",mark1,mark2,mark3);
	printf("%d %s %d %d %d",p->num,p->name,p->mark1,p->mark2,p->mark3);
	
}
int main(){
	input();
	deal();
	output();
	return 0;
}