Submission #1658276

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
int n,c,a;
vector<int> vec;

int main(){
	cin >> n >> c;
	REP(i,0,n) cin >> a,vec.push_back(a);
	sort(vec.begin(),vec.end());
	
	int cou=0,i=0,m=n-1;
	while(n){
		bool f=true;
		RREP(j,m,0)
			if(i!=j&&vec[i]+vec[j]+1<=c){vec.erase(vec.begin()+max(i,j)),vec.erase(vec.begin()+min(i,j)),cou++,n-=2,m=j-2,f=false; break;}
		if(f){cou+=n; break;}
	}
	
	cout << cou << endl;
	return 0;
}

Submission Info

Judge Result