codeforces 985C Liebig's Barrels 贪心

http://codeforces.com/problemset/problem/985/C
You have m = n·k wooden staves. The i-th stave has length ai. You have to assemble n barrels consisting of k staves each, you can use any k staves to construct a barrel. Each stave must belong to exactly one barrel.

Let volume vj of barrel j be equal to the length of the minimal stave in it.

You want to assemble exactly n barrels with the maximal total sum of volumes. But you have to make them equal enough, so a difference between volumes of any pair of the resulting barrels must not exceed l, i.e. |vx - vy| ≤ l for any 1 ≤ x ≤ n and 1 ≤ y ≤ n.

Print maximal total sum of volumes of equal enough barrels or 0 if it’s impossible to satisfy the condition above.

Input
The first line contains three space-separated integers n, k and l (1 ≤ n, k ≤ 105, 1 ≤ n·k ≤ 105, 0 ≤ l ≤ 109).

The second line contains m = n·k space-separated integers a1, a2, …, am (1 ≤ ai ≤ 109) — lengths of staves.

Output
Print single integer — maximal total sum of the volumes of barrels or 0 if it’s impossible to construct exactly n barrels satisfying the condition |vx - vy| ≤ l for any 1 ≤ x ≤ n and 1 ≤ y ≤ n.

Examples
Input
4 2 1
2 2 1 2 3 2 2 3
Output
7
Input
2 1 0
10 10
Output
20
Input
1 2 1
5 2
Output
2
Input
3 2 1
1 2 3 4 5 6
Output
0
Note
In the first example you can form the following barrels: [1, 2], [2, 2], [2, 3], [2, 3].

In the second example you can form the following barrels: [10], [10].

In the third example you can form the following barrels: [2, 5].

In the fourth example difference between volumes of barrels in any partition is at least 2 so it is impossible to make barrels equal enough.

题目大意：给你$n\ast k$根木棍和一个数$l$，每次可以选择任意$k$个木棍组成一个水桶，这个水桶的体积等于这$k$个木棍的最小长度，且任意两个水桶的体积之差的绝对值要小于等于$l$，问组成的$n$个水桶的体积之和的最大值。

思路：贪心。读入长度从小到大排序，长度最小的木根肯定是第一个水桶的体积，根据题目的限制条件$l$，我们可以二分找到一个位置$pos$满足$a[pos]>a[1]+l$，那么剩下的$n-1$根木棍就要从$a[2],a[3]\dots \dots a[pos-1]$中选择了，此时根据贪心策略，我们肯定希望尽量选右边的，而每选一个就要从$[pos,n\ast k]$中消去$k-1$根木棍，因此先计算右边剩余的木根可以供我们使用几次，这些消去之后，我们就不能连续的选最大的了，只能以$k$为界限选下去。细节问题见代码。

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;

const int maxn=1e5+5;

int n,l,k;
int a[maxn];

int main()
{
	scanf("%d%d%d",&n,&k,&l);
	int m=n*k;
	for(int i=1;i<=m;i++)
		scanf("%d",&a[i]);
	sort(a+1,a+m+1);
	int pos=upper_bound(a+1,a+m+1,a[1]+l)-a;
	if(pos<=n)
		printf("0\n");
	else
	{
		ll ans=a[1];
		--n,--pos;
		int num=0;
		if(k!=1)
			num=(m-pos)/(k-1);
		int temp=num;//至多可以连续的选num个
		int rest=m-pos-num*(k-1);//右边还剩下多少个可以选择
		rest++;
		while(temp&&n)
		{
			ans+=a[pos--];
			n--,temp--;
		}
		pos-=k-rest;//不足的要从左边减掉
		while(n)
		{
			ans+=a[pos];
			n--,pos-=k;
		}
		printf("%lld\n",ans);
	}
	return 0;
}