Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- typedef long long ll;
- int main()
- {
- ll q,n,r,i,cnt,mx,c1;
- cin>>q;
- while(q--){
- cnt=0;
- cin>>n>>r;
- ll a[n+5];
- for(i=0;i<n;i++)cin>>a[i];
- sort(a,a+n);
- mx=a[n-1];
- for(i=n-1;i>=0;i--){
- cnt=1;
- c1=cnt;
- if(a[i]!=mx){
- while(c1--)a[i]-=r;
- if(a[i]>0)cnt++;
- else
- break;
- }
- }
- cout<<cnt<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement