Guest User

Untitled

a guest
Nov 16th, 2018
97
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.61 KB | None | 0 0
  1. #include <iostream>
  2. #include <vector>
  3. #include <algorithm>
  4.  
  5. using namespace std;
  6.  
  7. int Answer;
  8.  
  9. int main(int argc, char** argv)
  10. {
  11. int T, test_case;
  12.  
  13. cin >> T;
  14. for (test_case = 0; test_case < T; test_case++)
  15. {
  16. int N, K;
  17. cin >> N >> K;
  18. vector<int> arr(N);
  19. for (int i = 0; i < N; i++) {
  20. cin >> arr[i];
  21. }
  22. sort(arr.begin(), arr.end());
  23. Answer = 0;
  24. int L = 0;
  25. for (int R = 0; R < N; R++) {
  26. // except I can go with arr[R]
  27. while (L < R && arr[R] - arr[L] > K) {
  28. L++;
  29. }
  30. Answer = max(Answer, R - L + 1);
  31. }
  32.  
  33. cout << "Case #" << test_case + 1 << endl;
  34. cout << Answer << endl;
  35. }
  36.  
  37. return 0;
  38. }
Add Comment
Please, Sign In to add comment