sacgajcvs

Untitled

Feb 16th, 2023
97
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.66 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int find_max_apples(int max_size_difference, vector<int> apple_sizes) {
  5. int n = apple_sizes.size();
  6. sort(apple_sizes.begin(), apple_sizes.end());
  7. int j = 0, mx = 0;
  8. for(int i = 0; i < n; i++) {
  9. while(j < n && apple_sizes[j] - apple_sizes[i] <= max_size_difference) {
  10. j++;
  11. }
  12. mx = max(mx, j- i);
  13. }
  14. return mx;
  15. }
  16.  
  17. int main()
  18. {
  19. int max_size_difference, n;
  20. cin >> max_size_difference >> n;
  21. vector<int> apple_sizes(n);
  22. for(int i = 0; i < n; i++) {
  23. cin >> apple_sizes[i];
  24. }
  25. cout << find_max_apples(max_size_difference, apple_sizes);
  26. return 0;
  27. }
Advertisement
Add Comment
Please, Sign In to add comment