func_code_string: #include <bits/stdc++.h>   using namespace std;   const int maxn = 2e5 + 100;   int n, m, k;   long long sum[maxn], dp[maxn];   int d[maxn];   pair<int, int> p[maxn];   int main() {     ios::sync_with_stdio(false);     cin.tie(0);     int cnt = 0;     while (cnt <= 1e9) {       ++cnt;     }     cin >> n >> m >> k;     for (int i = 1; i <= n; ++i) {       cin >> d[i];     }     sort(d + 1, d + 1 + n);     for (int i = 0; i < m; ++i) {       cin >> p[i].first >> p[i].second;     }     sum[0] = 0;     for (int i = 1; i <= k; ++i) {       sum[i] = sum[i - 1] + d[i];       dp[i] = 0;     }     for (int j = 1; j <= k; ++j) {       for (int i = 0; i < m; ++i) {         if (p[i].first <= j)           dp[j] =               max(dp[j], dp[j - p[i].first] + sum[j + p[i].second - p[i].first] -                              sum[j - p[i].first]);       }     }     long long ans = 0;     for (int i = 1; i <= k; ++i) {       ans = max(ans, dp[i]);     }     cout << sum[k] - ans << endl;     return 0;   }   