CodeForces 166A Rank List

场上有点被逼急了，直接结构体加重载等于运算符。呃，简单直白，清晰明了

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
struct team{
    int tn,ft;
    bool operator ==(const team &d){
        if(this->tn==d.tn&&this->ft==d.ft) return true;
        return false;
    }
};
team t[55];
bool cmp(team a,team b){
    if(a.tn==b.tn){return a.ft<b.ft;}
    return (a.tn>b.tn);
}
int main() {
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i=0;i<n;i++){
        scanf("%d%d",&t[i].tn,&t[i].ft);
    }
    sort(t,t+n,cmp);int cnt=0;
    for(int i=0;i<n;i++){
        if(t[i]==t[k-1]){cnt++;}//就是让求同种的有多少个嘛……等于就是呗
    }
    printf("%d\n",cnt);
    return 0;
}