2017多校联合第五场1011/hdu6095Rikka with Competition(排序)
2017-08-09 16:02
344 查看
Rikka with Competition
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 396 Accepted Submission(s): 328
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
Recommend
liuyiding | We have carefully selected several similar problems for you: 6095 6094 6093 6092 6091
Statistic | Submit | Discuss | Note
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int i,j,k,p,t;
int n;
int a[100001];
int tot;
cin>>t;
while(t--)
{
cin>>n>>k;
tot=1;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
sort(a+1,a+n+1);
for(i=n-1;i>=1;i--)
{
if(a[i+1]-a[i]<=k)tot++;
else break;
}
cout<<tot<<endl;
}
return 0;
}
相关文章推荐
- HDU 2017 多校联合训练赛8 1011 6143 Killer Names 排列组合
- 2016多校联合训练赛 第五场1011 Two hdu5791
- HDU 2017 多校联合训练赛2 1011 6055 Regular polygon map&pair
- 2017多校联合第二场 1011题 hdu 6055 Regular polygon 计算几何
- HDU 2017 多校联合训练赛1 1002 6034 Balala Power 排序
- 2017第四次多校联合hdu6078
- 2017 HDU 6092 多校联合赛 Rikka with Subset
- 2013暑期多校联合训练\第五场 Problem F Magic Pen 6
- 2017第二次多校联合hdu6047Maximum Sequence
- 2013 多校联合4 1011 Fliping game (hdu 4642)
- HDOJ多校联合第五场
- 2017 多校7 1011 Kolakoski
- HDU 2017 多校联合训练赛2 1009 6053 TrickGCD 莫比乌斯函数
- 2017多校联合一/hdu6040Hints of sd0061
- 2015多校联合第五场 hdu5349 MZL's simple problem 优先队列
- hdu 6143: Killer Names (2017 多校第八场 1011)
- 2017多校联合第二场 1001题 hdu 6045 Is Derek lying?
- HDU6058 [2017多校联合3] Kanade's sum 我可能是个假链表
- 2013多校联合训练第五场
- HDU 4643 GSM 暑期多校联合训练第五场 1001