Advertisement
wrench786

Diamond Collector

Jan 31st, 2022
616
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.60 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int arr[1001];
  5.  
  6. void solve(){
  7.     int n,k;
  8.     cin>>n>>k;
  9.  
  10.     for(int i=1;i<=n;i++){
  11.         cin>>arr[i];
  12.     }
  13.  
  14.     sort(arr+1,arr+1+n);
  15.  
  16.     int ans=0;
  17.     for(int i=1;i<=n;i++){
  18.         int co=1;
  19.  
  20.         for(int j=i+1;j<=n;j++){
  21.             if(abs(arr[i]-arr[j])<=k)co++;
  22.         }
  23.  
  24.         ans = max(ans,co);
  25.     }
  26.  
  27.     cout<<ans<<endl;
  28. }
  29.        
  30.  
  31. int main()
  32. {
  33.     freopen("diamond.in", "r", stdin);
  34.     freopen("diamond.out", "w", stdout);
  35.     int tc=1;
  36.     //scanf("%d",&tc);
  37.  
  38.     while(tc--){
  39.         solve();
  40.     }
  41. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement