Rikka with Competition
来源:互联网 发布:林俊杰家世 知乎 编辑:程序博客网 时间:2024/06/05 00:51
Rikka with Competition
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 321 Accepted Submission(s): 271
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
25 31 5 9 6 35 21 5 9 6 3
Sample Output
51
#include<iostream>#include<cstdio>#include<algorithm>using namespace std;int a[1000010];int main(){ int T,n,k; scanf("%d",&T); while(T--) { int ans=1; scanf("%d %d",&n,&k); for(int i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); for(int i=n-1;i>0;i--) { if(a[i]-a[i-1]<=k) ans++; else break; } printf("%d\n",ans); } return 0;}
- hdu2639 Rikka with Competition
- HDU6095 Rikka with Competition
- Rikka with Competition
- HDU6095-Rikka with Competition
- HDU6095-Rikka with Competition
- HDU 6095 Rikka with Competition
- HDU 6095 Rikka with Competition
- HDOJ 6095-Rikka with Competition
- hdu 6095-Rikka with Competition
- HDU 6095 Rikka with Competition【】
- hdu6095-思维-Rikka with Competition
- hdu 6095-Rikka with Competition
- HDU 6095 Rikka with Competition
- hdu 多校联赛 Rikka with Competition
- HDU6095 Rikka with Competition 模拟|签到
- Rikka with Competition(HDU 609)
- 2017多校5 1011 Rikka with Competition
- 多校5 HDU-6095 Rikka with Competition
- DWR传参问题:Missing method or Missing parameter converers:类名点方法名
- 怎么用PHP创建一个九九乘法表
- shiro整合oauth
- Swift 常量
- 旧SVN损坏项目,更换新的svn路径
- Rikka with Competition
- 基于Python检索系统(2)爬虫
- JavaMail学习笔记(一)、理解邮件传输协议(SMTP、POP3、IMAP、MIME)
- 华大基因生物信息学培训教材
- form表单提交多个下拉框获取select选项值,name相同
- linux下更改磁盘盘号
- Android定义使用颜色的方法
- UVA 10137
- 创建N个单向链表对它进行摧毁和清空操作