#include <bits/stdc++.h>
using namespace std;
#define int         long long int
#define rep(i,a,b)  for(int i=a; i<b; i++)

const int N = 2e5+5;
int a[N], n, m, k, sum[N];
pair<int,int>offer[N];
int dp[2005];

signed main()
{
       ios_base::sync_with_stdio(false);
       cin.tie(0);
       cout.tie(0);
       cin>>n>>m>>k;
       rep(i,1,n+1) cin>>a[i];
       sort(a+1,a+1+n);
       rep(i,1,k+1)
       {
              sum[i] = sum[i-1] + a[i];
       }
       rep(i,0,m)
       {
              int x,y;
              cin>>x>>y;
              offer[i+1]={x,y};
       }
       sort(offer+1, offer+1+m);
       rep(i, 0, k+1) dp[i]=sum[i];
       for(int j=1; j<=m; j++)
       {
              for(int i=0; i<=k; i++)
              {
                     if(offer[j].first>i) continue;
                     dp[i] = min(dp[i], sum[i] - sum[i-offer[j].first+offer[j].second] + dp[i-offer[j].first]);
              }
       }
       cout<<dp[k];
}
