提出 #72815885

---

ソースコード 拡げる

#include <stdio.h>
#include <stdlib.h>

int cmp(const void* x, const void* y) {
	int a = *(const int*)x, b = *(const int*)y;
	return (a > b) - (a < b);
}

int N, M;
int P[1024];

int scores[1024 * 1024];

int main(void) {
	int i, j;
	int num = 0;
	int ans = 0;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &P[i]) != 1) return 1;
	}
	for (i = 0; i < N; i++) {
		for (j = i; j < N; j++) {
			scores[num++] = P[i] + P[j];
		}
	}
	for (i = 0; i < N; i++) {
		scores[num++] = P[i];
	}
	scores[num++] = 0;
	qsort(scores, num, sizeof(*scores), cmp);
	for (i = 0; i < num && scores[i] <= M; i++) {
		int target = M - scores[i], candidate;
		int le = 0, g = num;
		while (le + 1 < g) {
			int m = le + (g - le) / 2;
			if (scores[m] <= target) le = m; else g = m;
		}
		candidate = scores[i] + scores[le];
		if (ans < candidate) ans = candidate;
	}
	printf("%d\n", ans);
	return 0;
}

/*

半分全列挙

*/

提出情報

ジャッジ結果