Submission #1659471

---

Source Code Expand

#include <bits/stdc++.h>
/*
*/

using namespace std;



int main(){
	long long int N, C;
	cin >> N >> C;
	vector<long long int>D(N);
	for( size_t i = 0; i < N; i++ ){
		cin >> D[i];
	}
	sort(D.rbegin(), D.rend());
	long long int ans = 0;
	vector<bool>F(N,true);
	for( size_t i = 0; i < N; i++ ){
		if(F[i] ){
			ans++;
			long long int minv = i+1, maxv = N;
			while( minv+1<maxv ){
				long long int midv = ( minv + maxv ) / 2;
				//cout << minv << " " << midv << " " << maxv << endl;

				if( D[i]+D[midv]+1<=C ){
					maxv = midv;
				} else{
					minv = midv;
				}
			}
			while( D[i] + D[minv] + 1 > C )minv++;
			//cout << minv << endl;
			while( minv < N&&!F[minv]  )minv++;
			if(minv<N)F[minv]= false;
			//cout << minv << endl;
		}
	}
	cout << ans << endl;
}

Submission Info

Judge Result