2160.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2160 on 2006-03-08 at 16:58:05 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int MAX = 102400;

int main()
{
	int i, stick[MAX], bin, n;

	while(scanf("%d", &n) != EOF) {
		scanf("%d", &bin);
		for(i = 0; i < n; i++) scanf("%d", &stick[i]);
		sort(stick, stick+n);
		int used = 0, l = 0;
		for(i = n-1; i >= l; i--) {
			used++;
			if(stick[l]+stick[i] <= bin) l++;
		}
		printf("%d\n", used);
	}
}