[codeforces] C. Liebig's Barrels

题目：

C. Liebig's Barrels

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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

Copy

4 2 1
2 2 1 2 3 2 2 3

output

Copy

7

input

Copy

2 1 0
10 10

output

Copy

20

input

Copy

1 2 1
5 2

output

Copy

2

input

Copy

3 2 1
1 2 3 4 5 6

output

Copy

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.

代码：

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void){
	int n, k, l;
	cin >> n >> k >> l;
	vector<int> nums(n*k);
	for(int i = 0; i < n*k; i++){
		cin >> nums[i];
	}
	sort(nums.begin(), nums.end());
	int cnt = 1;
	for(; cnt < n*k && nums[cnt] <= nums[0] + l ; cnt++);
	if(cnt < n) cout << 0;
	else{
		int ll = n*k - cnt;
		long long sum = 0;
		cnt--;
		while(cnt >= 0){
			if(ll != 0 && ll - k + 1 >= 0){
				ll -= k - 1;
				sum += nums[cnt--];
			}else{
				break;
			}
		}
		if(cnt >= 0){
			cnt = cnt + ll - k + 1;
			sum += nums[cnt];
			while(cnt >= k){
			sum += nums[cnt - k];
			cnt -= k;
			}
		}
		
		cout << sum;
	}
	return 0;
} 

结果：