1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main() {
int n, m, h, k;
while(cin >> n >> m >> h >> k) {
if(n == 0 && m == 0 && h == 0 && k == 0) break;
vector<int> cost(n);
rep(i, n) cin >> cost[i];
vector<P> p(m);
rep(i, m) cin >> p[i].second >> p[i].first;
sort(p.begin(), p.end());
vector<int> id(n);
rep(i, n) id[i] = i;
rep(i, m) {
swap(id[ p[i].second-1 ], id[ p[i].second]);
}
int ans = 0;
vector<int> v(n);
rep(i, n) {
v[id[i]] = cost[i];
if(id[i] < k) ans += cost[i];
}
int res = 0;
for(int i = m-1; i >= 0; i--) {
int a = id[ p[i].second-1];
int b = id[ p[i].second];
if(a < k && k <= b) {
if(v[a] > v[b]) {
res = max(res, v[a] - v[b]);
}
} else if(b < k && k <= a) {
if(v[b] > v[a]) {
res = max(res, v[b] - v[a]);
}
}
swap(id[ p[i].second-1], id[p[i].second]);
}
cout << ans - res << endl;
}
return 0;
}
|