F - Bin Packing （贪心）

A set of n 1-dimensional items have to be packed in identical bins. All bins have exactly the same length l and each item i has length li<=l . We look for a minimal number of bins q such that
each bin contains at most 2 items,
each item is packed in one of the q bins,
the sum of the lengths of the items packed in a bin does not exceed l .

You are requested, given the integer values n , l , l₁ , …, l_n , to compute the optimal number of bins q .

Input
The first line of the input contains the number of items n (1<=n<=105) . The second line contains one integer that corresponds to the bin length l<=10000 . We then have n lines containing one integer value that represents the length of the items.

Output
Your program has to write the minimal number of bins required to pack all items.

Sample Input
10
80
70
15
30
35
10
80
20
35
10
30

Sample Output
6

Hint
The sample instance and an optimal solution is shown in the figure below. Items are numbered from 1 to 10 according to the input order.

题目大意：
第一行给出物品个数n，第二行给出箱子的大小，后面n行给出各物品的大小，箱子最多装2个物品

解题思路：
贪心思想，最大的和最小的放一起，因为最小的当然和越大的放一起最能充分利用空间。

完整代码：

#include<iostream>
#include<algorithm>
using namespace std;
int main(){
	int n,m,a[100010];
	int ans=0;
	cin>>n>>m;
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	sort(a,a+n);//排序 
	int l=0,r=n-1;
	while(r>=l){
		if(a[l]+a[r]<=m){//可以放两个就放两个 
			l++;
			r--;
		}else{	// 不可以就放大的 
			r--;
		}
		ans++;
	}
	cout<<ans;
}