#include <algorithm>

#include <iostream>

#include <cstdio>

using namespace std;

int main()

{

    int a[]={,,,,,};

    sort(a,a+);

    for(int i=;i<;i++){

        printf("%d ",a[i]);

    }

    return ;

}

#include <algorithm>

#include <iostream>

#include <cstdio>

using namespace std;

bool compare(int a,int b){

    return a>b;

}

int main()

{

    int a[]={,,,,,};

    sort(a,a+,compare);

    for(int i=;i<;i++){

        printf("%d ",a[i]);

    }

    return ;

}

struct student{

    int num;            //学号

    int score;          //成绩

};

bool cmp(student a,student b){//按成绩降序,再按学号升序

    if(a.score>b.score)return a.num<b.num;

    return a.score>b.score;

}

struct student stu[];

//输入学生数据

sort(a,a+,cmp);

​

vector<int>s;

sort(s.begin(),s.end());