Rank List CodeForces - 166A

最新推荐文章于 2020-07-26 15:18:19 发布

Lila_老妖

最新推荐文章于 2020-07-26 15:18:19 发布

阅读量584

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM-水水水~

本文链接：https://blog.youkuaiyun.com/qq_32823673/article/details/69389799

ACM-水水水~ 专栏收录该内容

15 篇文章

订阅专栏

本文详细介绍了 CodeForces 166A 题目中的比赛排名算法实现过程，包括如何通过比较队伍解决的问题数量及总罚时来确定排名，以及如何处理并列情况。提供了完整的 C++ 实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

H - Rank List

CodeForces - 166A

Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the total penalty time. However, for no team we are shown its final place.

You know the rules of comparing the results of two given teams very well. Let's say that teama solved p_a problems with total penalty timet_a and teamb solved p_b problems with total penalty timet_b. Teama gets a higher place than team b in the end, if it either solved more problems on the contest, or solved the same number of problems but in less total time. In other words, teama gets a higher place than team b in the final results' table if either p_a > p_b, orp_a = p_b andt_a < t_b.

It is considered that the teams that solve the same number of problems with the same penalty time share all corresponding places. More formally, let's say there is a group ofx teams that solved the same number of problems with the same penalty time. Let's also say thaty teams performed better than the teams from this group. In this case all teams from the group share placesy + 1, y + 2,..., y + x. The teams that performed worse than the teams from this group, get their places in the results table starting from they + x + 1-th place.

Your task is to count what number of teams from the given list shared the k-th place.

Input

The first line contains two integers n andk (1 ≤ k ≤ n ≤ 50). Thenn lines contain the description of the teams: thei-th line contains two integers p_i and t_i (1 ≤ p_i, t_i ≤ 50) — the number of solved problems and the total penalty time of the i-th team, correspondingly. All numbers in the lines are separated by spaces.

Output

In the only line print the sought number of teams that got the k-th place in the final results' table.

Example

Input

Output

Input

Output

Note

The final results' table for the first sample is:

1-3 places — 4 solved problems, the penalty time equals 10
4 place — 3 solved problems, the penalty time equals 20
5-6 places — 2 solved problems, the penalty time equals 1
7 place — 1 solved problem, the penalty time equals 10

The table shows that the second place is shared by the teams that solved 4 problems with penalty time 10. There are 3 such teams.

The final table for the second sample is:

1 place — 5 solved problems, the penalty time equals 3
2-5 places — 3 solved problems, the penalty time equals 1

The table shows that the fourth place is shared by the teams that solved 3 problems with penalty time 1. There are 4 such teams.

#include<cstdio>
#include<cstring>
#include<iostream>
#include<cstdlib>
#include<algorithm>
using namespace std;
struct node
{
    int x;
    int y;
};

struct node stu[55];
int cmp(node a,node b)
{
    return a.x!=b.x?
            a.x>b.x:a.y<b.y;
}
int main()
{
    int n,k,i;
    while(scanf("%d%d",&n,&k)!=EOF)
    {
        int sum=0;
        for(i=0;i<n;i++)
            scanf("%d%d",&stu[i].x,&stu[i].y);
        sort(stu,stu+n,cmp);
        for(i=0;i<n;i++)
        {
            if(stu[k-1].x==stu[i].x&&stu[k-1].y==stu[i].y)
                sum++;
        }
        printf("%d\n",sum);
    }
    return 0;
}