C++代码

#include <iostream>
#include <algorithm>
using namespace std;
struct A
{
int id,a,b,c;
} w[1010];
bool cmp( A &x,A &y )
{
if ( x.a != y.a ) return x.a > y.a;
if ( x.c != y.c ) return x.c > y.c;
if ( x.b != y.b ) return x.b < y.b;
return x.id < y.id;
}
int main()
{
int n;
cin >> n;
for ( int i = 0; i < n; i++ ) cin >> w[i].id >> w[i].a >> w[i].b >> w[i].c;
sort( w, w + n, cmp );
for ( int i = 0; i < n; i++ )
{
if( i > 0 ) cout << " ";
cout << w[i].id;
}
return 0;
}