BOJ 12005 - Diamond Collector (Bronze) [C++]

문제

링크

풀이

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
 
void solve(void) {
  int n, k; cin >> n >> k;
  vector<int> v(n);
  for (int i=0; i<n; i++) cin >> v[i];
  sort(v.begin(), v.end());
 
  int ans = 0;
  for (int i=0; i<n; i++) {
    int cnt = 1;
    for (int j=i+1; j<n; j++) {
      if (v[j] - v[i] <= k) cnt++;
      else break;
    }
    ans = max(ans, cnt);
  }
  cout << ans;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}