Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int arr[1001];
- void solve(){
- int n,k;
- cin>>n>>k;
- for(int i=1;i<=n;i++){
- cin>>arr[i];
- }
- sort(arr+1,arr+1+n);
- int ans=0;
- for(int i=1;i<=n;i++){
- int co=1;
- for(int j=i+1;j<=n;j++){
- if(abs(arr[i]-arr[j])<=k)co++;
- }
- ans = max(ans,co);
- }
- cout<<ans<<endl;
- }
- int main()
- {
- freopen("diamond.in", "r", stdin);
- freopen("diamond.out", "w", stdout);
- int tc=1;
- //scanf("%d",&tc);
- while(tc--){
- solve();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement