admin管理员组

文章数量:1530061

Rikka with Competition

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 479 Accepted Submission(s): 393

Problem Description
As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:

A wrestling match will be held tomorrow. n players will take part in it. The ith player’s strength point is ai.

If there is a match between the ith player plays and the jth player, the result will be related to |ai−aj|. If |ai−aj|>K, the player with the higher strength point will win. Otherwise each player will have a chance to win.

The competition rules is a little strange. Each time, the referee will choose two players from all remaining players randomly and hold a match between them. The loser will be be eliminated. After n−1 matches, the last player will be the winner.

Now, Yuta shows the numbers n,K and the array a and he wants to know how many players have a chance to win the competition.

It is too difficult for Rikka. Can you help her?

Input
The first line contains a number t(1≤t≤100), the number of the testcases. And there are no more than 2 testcases with n>1000.

For each testcase, the first line contains two numbers n,K(1≤n≤105,0≤K<109).

The second line contains n numbers ai(1≤ai≤109).

Output
For each testcase, print a single line with a single number – the answer.

Sample Input
2
5 3
1 5 9 6 3
5 2
1 5 9 6 3

Sample Output
5
1

Source
2017 Multi-University Training Contest - Team 5

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int MAXN=1e5+5;
int a[MAXN];

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n,k;
        int flag=0;
        scanf("%d%d",&n,&k);
        for(int i=1;i<=n;++i)
        {
            scanf("%d",&a[i]);
        }
        sort(a+1,a+n+1);
        for(int i=n-1;i>=1;--i)
        {
            if(a[i+1]-a[i]>k) {flag=i;break;}
        }
        int ans=0;
        for(int i=n;i>=1;--i)
        {
            if(i!=flag) ans++;
            else break;
        }
        printf("%d\n",ans);
    }
    return 0;
}

本文标签： Rikkacompetition

版权声明：本文标题：HDU6095-Rikka with Competition 内容由热心网友自发贡献，该文观点仅代表作者本人， 转载请联系作者并注明出处：https://m.elefans.com/xitong/1726694443a1081050.html， 本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容，一经查实，本站将立刻删除。