结构体排序写法

#include <bits/stdc++.h>
using namespace std;
int n;
struct yg{
	string name;
	int id,bid,xin,ji;
	void in(){
		cin>>id>>xin>>bid>>ji;
	}
	void out(){
		cout<<id<<" ";
	}
}arr[1005];
bool cmp(yg a,yg b){
	if(a.xin!=b.xin)return a.xin>b.xin;
    if(a.ji!=b.ji)return a.ji>b.ji;
    if(a.bid!=b.bid)return a.bid<b.bid;
    return a.id<b.id;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		arr[i].in();
	}
	sort(arr+1,arr+n+1,cmp);
	for(int i=1;i<=n;i++){
		arr[i].out();
	}
	return 0;
}