Contest3145 - the 37th game of 2021 freshman individual training match_ D: Ranking

//
 problem  D:  ranking 
 The time limit : 1.000 Sec   Memory limit : 128 MB
 
 Title Description 
 Ningbo primary school students finished the programming competition in Zhenhai middle school , The teachers approved the success of all the students   performance , Grades are ranked from high to low , The same grades are ranked from low to high by grade （ notes ： It's pure fiction , Don't enter   seat ）. Now the organizer wants to know the top students of each ranking , Several students are below his grade （ she ）.
 Input 
 There are several lines ：  The first 1 Line has only one positive integer n（1<=n<=200）, Indicates the number of students participating .  The first 2 To the first n+1 Lines in total n That's ok , Each line has two positive integers s（0<=s<=400）,g（1<=g<=6）. Among them the first  i+1 First number of rows s It means the first one i Results of students , The first i+1 The second number in the row g It means the first one i Grade of students .
 Output 
 The output file paiming.out Yes n That's ok , There is only one positive integer per line , Among them the first i Number of rows k Indicates rank i Students of   There is k Students rank higher than him （ she ） high , And the grade is higher than him （ she ） low .
 The sample input  Copy
5
300 5
200 6
350 4
400 6
250 5
 Sample output  Copy
0
0
1
1
3

//
#include<bits/stdc++.h>
using namespace std;
 
const int MAXN=222;
 
typedef struct student
{
    int s,g;
}T;
T a[MAXN];
 
bool cmp( T x,T y )
{
    if( x.s>y.s ) return true;
    else if( x.s==y.s )
    {
        if( x.g<=y.g ) return true;
        else           return false;
    }
    else          return false;
}
 
int main()
{
    int n,s,g,i,j,ans;
 
    while( ~scanf("%d",&n) )
    {
        for( i=0;i<n;i++ ) scanf("%d%d",&a[i].s,&a[i].g);
 
        sort( a,a+n,cmp );
 
        for( i=0;i<n;i++ )
        {
            ans=0;
            for( j=0;j<i;j++ ) if( a[j].g<a[i].g ) ans++;
 
            printf("%d\n",ans);
        }
    }
    return 0;
}