Problem:
Score : 700 points

Problem Statement

N problems are proposed for an upcoming contest. Problem i has an initial integer score of A_i points.

M judges are about to vote for problems they like. Each judge will choose exactly V problems, independently from the other judges,
and increase the score of each chosen problem by 1.

After all M judges cast their vote, the problems will be sorted in non-increasing order of score, and the first P problems will be chosen for the problemset.
Problems with the same score can be ordered arbitrarily, this order is decided by the chief judge.

How many problems out of the given N have a chance to be chosen for the problemset?

Constraints

2 \le N \le 10^5

1 \le M \le 10^9

1 \le V \le N - 1

1 \le P \le N - 1

0 \le A_i \le 10^9

Input

Input is given from Standard Input in the following format:

N M V P
A_1 A_2 ... A_N

Output

Print the number of problems that have a chance to be chosen for the problemset.

Sample Input 1

6 1 2 2
2 1 1 3 0 2

Sample Output 1

5

If the only judge votes for problems 2 and 5, the scores will be 2 2 1 3 1 2.
The problemset will consist of problem 4 and one of problems 1, 2, or 6.

If the only judge votes for problems 3 and 4, the scores will be 2 1 2 4 0 2.
The problemset will consist of problem 4 and one of problems 1, 3, or 6.

Thus, problems 1, 2, 3, 4, and 6 have a chance to be chosen for the problemset. On the contrary, there is no way for problem 5 to be chosen.

Sample Input 2

6 1 5 2
2 1 1 3 0 2

Sample Output 2

3

Only problems 1, 4, and 6 have a chance to be chosen.

Sample Input 3

10 4 8 5
7 2 3 6 1 6 5 4 6 5

Sample Output 3

8

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
typedef long long ll;

int main() {
    ll n, m, v, p;
    cin >> n >> m >> v >> p;

    vector<ll> a(n);
    for (int i = 0; i < n; i++)cin >> a[i];
    sort(a.begin(), a.end());
    int ignore = n - (p - 1);
    while (ignore < n && ignore - 1 >= 0 && a[ignore] == a[ignore - 1])ignore--;
    // ignoreは上位p-1位以内の数相当のうち、最初のindex

    vector<ll> c_sum(n + 1);
    for (int i = 0; i < n; i++)c_sum[i + 1] = c_sum[i] + a[i];

    int first = -1;
    for (int i = 0; i < n; i++) {
        auto itr = upper_bound(a.begin(), a.end(), a[i]);
        if (itr == a.end()) {
            first = i;
            break;
        } else {
            int x = itr - a.begin() - 1; // a[i]と同じで一番最後のindex
            int range = ignore - x - 1; // a[i]が勝てないといけない数の個数
            ll want = c_sum[ignore] - c_sum[x + 1]; // [x+1, ignore-1]
            want -= a[i] * range;
            int maxDiff = a[n - p] - a[i]; // a[i]は少なくともa[n-p]と引き分けにならなければいけない
            if (want <= min(n - v, (ll) range) * m && maxDiff <= m) {
                first = i;
                break;
            }
        }
    }
    cout << n - first << endl;
    return 0;
}