|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||0||0||0||0.000%|
You must have heard about Great Bitonic Conference (if not, read the description of the "Conference" task). Organizers of the GBC are in trouble again and they are seeking your help. The original version of the registration system has a special mechanism for maximizing the income from the conference. It is achieved by canceling some of the booked tickets (it allows to reduce expenses on the renting of conference rooms). Such an approach is not acceptable however. People are dissatisfied with the fact that conference's organizers cancelled some of the tickets booked within a single reservation. You are asked to modify the registration system in such way, that the income from the conference is maximized, while cancellation of only whole reservations is allowed.
Write a program which:
In the first line of the standard input there are four integers: m, l, k and s (1 ≤ m ≤ 100, 2 ≤ l ≤ 1 000 000, 2 ≤ k ≤ 400, 1 ≤ s ≤ 1 000), separated by single spaces. They represent: the number of presentations, the number of reservations, the size of a single room and the cost of renting a single room. The second line contains exactly m numbers ci (ci · ⌊k / 2⌋ ≥ s, ci ≤ s), separated by single spaces (the lower limit on the value of ci is due to profitability of renting a room for ⌊k / 2⌋ participants of a conference). They represent prices of tickets for the presentations (numbered from 1 to m). Following l lines contain descriptions of reservations. Each reservation is represented by two integers pi and ri (1 ≤ pi ≤ m, 1 ≤ ri ≤ 1 000), separated by a single space. They represent the number of a presentation and the number of tickets booked for this presentation. It is only allowed to cancel all tickets reserved within the same reservation.
The first and only line of the standard output should contain exactly one integer - the total income that can be obtained by potentially cancelling only whole reservations.
3 2 10 30 7 10 8 1 9 3 13