#include <bits/stdc++.h>
using namespace std;
int shoe, some, want, a[200005], costfree[200005], x, y;
long long sum[200005], dp[200005];
int main() {
  scanf("%d%d%d", &shoe, &some, &want);
  for (register int i = 1; i <= shoe; i++) {
    scanf("%d", &a[i]);
  }
  sort(a + 1, a + shoe + 1);
  for (register int i = 1; i <= shoe; i++) {
    sum[i] = sum[i - 1] + a[i];
  }
  for (register int i = 1; i <= some; i++) {
    scanf("%d%d", &x, &y);
    costfree[x] = (costfree[x] > y ? costfree[x] : y);
  }
  memset(dp, 0x7f, sizeof(dp));
  ;
  dp[0] = 0;
  for (register int i = 1; i <= want; i++) {
    for (register int j = 0; j < i; j++) {
      dp[i] = (dp[i] < dp[j] + (sum[i] - sum[j + costfree[i - j]])
                   ? dp[i]
                   : dp[j] + (sum[i] - sum[j + costfree[i - j]]));
    }
  }
  printf("%lld\n", dp[want]);
  return 0;
}
