65,208
社区成员
发帖
与我相关
我的任务
分享struct student t;
for (i=0;i<100-1;i++) {
for (j=i+1;j<100;j++) {
if (s[i].ge<s[j].ge) {t=s[i];s[i]=s[j];s[j]=t;}
}
}typedef struct student{
int ge;
int gi;
int first;
int second;
int third;
int four;
int five;
int num;
int final;
}student;
student s[100];
bool operator<( const student& l, const student& r)
{
return l.ge<r.ge;
}
int main( )
{
std::sort( s,s+100 );
}