二分求调

#include<bits/stdc++.h>
using namespace std;
#define int long long 
const int maxn=200005;
int a[maxn],mid;
int n,m,k,o,j,ans;
bool judge(int x){
	if(x>=k){
		return true;
	}
	else{
		return false;
	}
}
signed main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
    }
    sort(a+1,a+1+n);
    for(int i=1;i<=n;i++){
    	cout<<a[i]<<" ";
	}
	cout<<endl;
    for(int i=1;i<=n;i++){
    	ans=0;
	    k=a[i]+m;
	    int l=1,r=n;
		while(l<=r){
			mid=(l+r)/2;
			if(judge(a[mid])){
				r=mid-1;
				ans=a[mid];
			}
			else{
				l=mid+1;
			}
		}	
		if(ans==k){
			cout<<k<<" "<<mid<<endl;
			for(int j=mid;j<=n;j++){
				if(a[j]==k){
					o++;
				}
				else break;
			}	
		}	
	}
	cout<<o;
	return 0;
}