Bình luận

• 
  

  -1

  

  khanh  đã bình luận 2:17:24 ch, 19/11/2024

  bài làm lại

  include <iostream>

  include <vector>

  include <algorithm>

  include <cmath>

  using namespace std;

  int main() { int n, k; cin >> n >> k;

  Copy

  vector<int> h(n);
  
  
  for (int i = 0; i < n; i++) {
      cin >> h[i];
      h[i] = abs(h[i]);  
  }
  
  
  sort(h.begin(), h.end(), greater<int>());
  
  int d = 1;  
  int j = 0; 
  
  
  for (int i = 1; i < n; i++) {
      if (h[j] - h[i] > k) {
          d++;   
          j = i; 
      }
  }
  
  
  cout << d << endl;
  
  return 0;
  

  }

• 
  

  0

  

  khanh  đã bình luận 1:59:03 ch, 19/11/2024

  include <iostream>

  include <vector>

  include <algorithm>

  using namespace std;

  int main() { int n, k; cin >> n >> k;
  vector<int> heights(n);

  Copy

  for (int i = 0; i < n; i++) {
      cin >> heights[i];
  }
  
  
  sort(heights.begin(), heights.end());
  
  int groups = 0;  
  int i = 0;
  
  
  while (i < n) {
      groups++;  
      int start = heights[i];  
  
  
      while (i < n && heights[i] - start <= k) {
          i++;
      }
  }
  
  
  cout << groups << endl;
  
  return 0;
  

  }