Submission #3425272

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define rep(i, a) for (int i = 0; (i) < (int) (a); (i)++)
#define reps(i, a, b) for (int i = (int) (a); (i) < (int) (b); (i)++)
#define rrep(i, a) for (int i = (int) a-1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int) (a)-1; (i) >= (int) (b); (i)--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) sort(all(v));(v).erase(unique(all(v)), v.end())
#define CIN(type, x) type x;cin >> x
#define TRUE__  "Yes"
#define FALSE__ "No"
#define PRINT(f) if((f)){cout << (TRUE__) << endl;}else{cout << FALSE__ << endl;}
#define RS(N) resize(N)
#define CINV(v, N) do {\
	v.RS(N);\
	rep(i, N) cin >> v[i];\
} while (0);
#define RCINV(v, N) do {\
	v.RS(N);\
	rrep(i, N) cin >> v[i];\
} while (0);

#define MOD 1000000007

void init();
void solve();

signed main()
{
	init();
	solve();
}

int N;
int C;
vector<int> l;

void init()
{
	cin >> N >> C;
	CINV(l, N);
	sort(all(l));
}

void solve()
{
	int big = N-1;
	int small = 0;
	for (; big >= 0 && l[big] + l[0] + 1 > C; big--);
	if (big <= 0) {
		cout << N << endl;
		return;
	}
	int res = N;
	while (big > small) {
		for (; big > small && l[big] + l[small] + 1 > C; big--);
		if (big == small) break;
		res--;
		small++;
		big--;
	}
	cout << res << endl;
}

Submission Info

Judge Result