Codeforces 985 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<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e5+7;

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


int main()
{
    //freopen("in.txt", "r", stdin);
    while(~scanf("%d%d%d", &n, &k, &l))
    {
        m = n*k;
        for(int i = 0; i < m; i++) scanf("%lld", &a[i]);
        sort(a, a+m);
        ll ans = 0, sum = 0, num = 0;
        for(int i = m - 1; i >= 1; i--)
        {
            if((a[i] - a[0]) <= l&&sum>=(k-1))
            {
                num++;
                sum -=(k - 1);
                ans += a[i];
            } else sum++;
        }
        if(num == (n - 1))
        printf("%lld\n", ans+a[0]);
        else printf("0\n");
    }
    return 0;
}