hdu 6095-Rikka with Competition
来源:互联网 发布:java valueof 编辑:程序博客网 时间:2024/06/08 13:11
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
# include <iostream>#include <bits/stdc++.h>using namespace std;int main(){ int N; cin>>N; while(N--) { int n,k; int a[500001]; cin>>n>>k; for (int i=0; i<n; i++) { cin>>a[i]; } sort(a,a+n); int ans=0; int flag=0; for (int i=n-1; i>0; i--) { if (abs(a[i]-a[i-1])<=k) { ans += 1; //cout<<"!!!!"<<endl; } else { ans += 1; flag=1; break; } } if (abs(a[0]-a[1])<=k&&flag==0) ans++; cout<<ans<<endl; }}
- HDU 6095 Rikka with Competition
- HDU 6095 Rikka with Competition
- hdu 6095-Rikka with Competition
- HDU 6095 Rikka with Competition【】
- hdu 6095-Rikka with Competition
- HDU 6095 Rikka with Competition
- 多校5 HDU-6095 Rikka with Competition
- HDU 6095 Rikka with Competition(思维)
- HDU 6095 Rikka with Competition(水~)
- HDOJ 6095-Rikka with Competition
- 刷题——hdu 6095 Rikka with Competition
- 2017多校五 1011题 hdu 6095 Rikka with Competition
- HDU 6095 Rikka with Competition【阅读题】【水题】
- hdu 多校联赛 Rikka with Competition
- Rikka with Competition(HDU 609)
- hdu2639 Rikka with Competition
- HDU6095 Rikka with Competition
- Rikka with Competition
- 注意java分隔符
- python简介
- oracle的应用(面试题目示例)
- 七牛云图片上传
- Android上ORMLite的配置和简单使用
- hdu 6095-Rikka with Competition
- fopen()和file_get_contents()打开URL获得网页内容的用法区别
- 数据结构上机实验之二分查找
- 通信里 星座图 到底是什么
- Linux 正则表达式与文件格式化处理
- HDU 4549 M斐波那契数列 (矩阵快速幂 + 费马小定理)
- 线程绑核的简单操作
- 关闭微信页面/判断设备/判断浏览器
- 文件权限限制解读