vector 结构体排序_指下码上横戈行——排序

sort(首元素地址， 尾元素地址的下一个地址， cmp)

bool cmp(int a,int b){
    return a > b;
}
bool cmp(node a,node b){
    return a.x > b.x;
}

bool cmp(student a,student b){
    if(a.flag != b.flag) return a.flag < b.flag;
    else if(a.sum != b.sum) return a.sum > b.sum;
    else if(a.virtue != b.virtue) return a.virtue > b.virtue;
    else return strcmp(a.id, b.id) < 0;
}

#include <iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct student{
    char id[10];
    int virtue;
    int talent;
    int sum;
    int flag;
};
 
bool cmp(student a, student b){
    if(a.flag != b.flag) return a.flag < b.flag;
    else if(a.sum != b.sum) return a.sum > b.sum;
    else if(a.virtue != b.virtue) return a.virtue > b.virtue;
    else return strcmp(a.id, b.id) < 0;
}
 
int main()
{
    int n,low,high;
    cin >> n >> low >> high;
    struct student stu[n];
    int m=n;
    for(int i = 0; i<n; i++){
        cin >> stu[i].id >> stu[i].virtue >> stu[i].talent;
        stu[i].sum = stu[i].virtue + stu[i].talent;
        if(stu[i].virtue<low||stu[i].talent<low) {
            stu[i].flag = 5;
            m--;
        }
        //分类的步骤
        else if(stu[i].virtue>=high&&stu[i].talent>=high) stu[i].flag = 1;
        else if(stu[i].virtue>=high&&stu[i].talent<high) stu[i].flag = 2;
        else if(stu[i].virtue>stu[i].talent) stu[i].flag = 3;
        else stu[i].flag = 4;
    }
    sort(stu, stu+n,cmp);//直接将n个元素按照cmp中规定好的顺序排序
    cout << m << endl;
    for(int i=0;i<m;i++){
        cout << stu[i].id << ' ' << stu[i].virtue << ' ' << stu[i].talent << endl;
    }
    return 0;
}

2
5
1234567890001 95
1234567890005 100
1234567890003 95
1234567890002 77
1234567890004 85
4
1234567890013 65
1234567890011 25
1234567890014 100
1234567890012 85

9
1234567890005 1 1 1
1234567890014 1 2 1
1234567890001 3 1 2
1234567890003 3 1 2
1234567890004 5 1 4
1234567890012 5 2 2
1234567890002 7 1 5
1234567890013 8 2 3
1234567890011 9 2 4

bool cmp(Student a,Student b){
   if(a.scores != b.scores)return a.scores > b.scores;//不同分数按照从大到小
   else return strcmp(a.id,b.id) < 0;//相同分数，按照id从小到大
}

stu[0].fra = 1;
    for(int i=1;i<m;i++){
        if(stu[i].scores == stu[i-1].scores) stu[i].fra = stu[i-1].fra;
        else stu[i].fra = i+1;
    }

#include <cstdio>
#include<cstring>
#include<algorithm>
 
struct Student{
    char id[14];
    int scores;
    int fra,lora;//总排名与区域排名
    int location;
}stu[30000];
/*比较规则*/
bool cmp(Student a,Student b){
   if(a.scores != b.scores)return a.scores > b.scores;//不同分数按照从大到小
   else return strcmp(a.id,b.id) < 0;//相同分数，按照id从小到大
}
 
using namespace std;
 
int main()
{
    int n,m=0;
    scanf("%d",&n);
    /*input data*/
    for(int i=0;i<n;i++){
        int k;//第i+1考场的考生数
        scanf("%d",&k);
        for(int j=0;j<k;j++){
            scanf("%s%d",stu[m+j].id,&stu[m+j].scores);//这里给第i+1个考场的考生依次赋值
            stu[m+j].location = i+1;
        }
        sort(stu+m,stu+m+k,cmp);//对当前考场k个考生进行排序
        stu[m].lora = 1;
        for(int t=1;t<k;t++){
            if(stu[m+t].scores == stu[m+t-1].scores) stu[m+t].lora = stu[m+t-1].lora;
            else stu[m+t].lora = t+1;
        }
        m +=k;//m是用来计算已输入考场的考生数目
    }
    sort(stu,stu+m,cmp);//对全体考生进行排序
    stu[0].fra = 1;
    for(int i=1;i<m;i++){
        if(stu[i].scores == stu[i-1].scores) stu[i].fra = stu[i-1].fra;
        else stu[i].fra = i+1;
    }
    printf("%dn",m);
    for(int i=0;i<m;i++){
        printf("%s %d %d %dn",stu[i].id,stu[i].fra,stu[i].location,stu[i].lora);
    }
    return 0;
}