Saleh127

Untitled

May 15th, 2020
142
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.61 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define test int t; cin>>t; while (t--)
  4. #define ll long long int
  5. #define sc(a) scanf("%lld",&a)
  6. #define pf(a) printf("%lld",a)
  7. #define sc2(a,b) scanf("%lld %lld",&a,&b)
  8. int main()
  9. {
  10. int x,t,a[10000],c,d,e,f,i,j,n,k,l;
  11. cin>>t;
  12. for(x=1;x<=t;x++)
  13. {
  14. c=1;
  15. cin>>n>>k;
  16. for(i=0;i<n;i++)
  17. {
  18. cin>>a[i];
  19. }
  20. sort(a,a+n);
  21. for(i=1;i<n;i++)
  22. {
  23. if(a[i]-a[i-1]>k)
  24. {
  25. c++;
  26. }
  27. }
  28. printf("Case #%d: %d\n",x,c);
  29. }
  30. return 0;
  31. }
Advertisement
Add Comment
Please, Sign In to add comment