#include <bits/stdc++.h>
using namespace std;
template <typename P, typename Q>
ostream& operator<<(ostream& os, pair<P, Q> p) {
  os << "(" << p.first << "," << p.second << ")";
  return os;
}
template <typename P, typename Q>
istream& operator>>(istream& is, pair<P, Q>& p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
  os << "(";
  for (auto& i : v) os << i << ",";
  os << ")";
  return os;
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
  for (auto& i : v) is >> i;
  return is;
}
template <typename T>
inline T setmax(T& a, T b) {
  return a = std::max(a, b);
}
template <typename T>
inline T setmin(T& a, T b) {
  return a = std::min(a, b);
}
template <typename T>
struct Acc {
  vector<T> sum;
  Acc(vector<T> v) {
    sum.push_back(0);
    for (auto& i : v) {
      sum.push_back(sum.back() + i);
    }
  }
  T query(int begin, int end) { return sum.at(end) - sum.at(begin); }
};
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m, k;
  while (cin >> n >> m >> k) {
    vector<long long int> v(n);
    cin >> v;
    sort(begin(v), end(v));
    while (k < v.size()) v.pop_back();
    vector<pair<int, int>> u(m);
    cin >> u;
    Acc<long long int> acc(v);
    const int N = 2000 + 5;
    static long long int dp[N];
    fill(dp, dp + N, 1 << 29);
    dp[0] = 0;
    for (int i = 0; i < k; ++i) {
      setmin(dp[i + 1], dp[i] + acc.query(i, i + 1));
      for (auto& j : u) {
        int x = i + j.first;
        if (x <= k) {
          setmin(dp[x], dp[i] + acc.query(i, i + j.first) -
                            acc.query(i, i + j.second));
        }
      }
    }
    cout << dp[k] << endl;
  }
  return 0;
}
