F. Shovels Shop

http://codeforces.com/contest/1154/problem/F

题意：从n个中选k个每个的花费a[i];每买够xi个最便宜的yi个免费；问最小花费；

思路：dp[i]，表示买了i个；枚举前一次买了多少个再加上现在买的优惠取最小值；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x) memset(x,0,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e5+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}


map<int,int>mp;
ll a[maxn];
ll dp[maxn];
ll sum[maxn];
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int n,m,k;
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=0;i<=n;i++) dp[i]=INF;
    dp[0]=0;
    for(int i=0;i<m;i++)
    {
        int x,y;
        cin>>x>>y;
        mp[x]=max(mp[x],y);
    }
    sort(a+1,a+1+n);
    for(int i=1;i<=n;i++)
    {
        sum[i]=sum[i-1]+a[i];
    }
    for(int i=1;i<=k;i++)
    {
        dp[i]=sum[i];
        for(int j=0;j<=i;j++)
        {
            if(mp[i-j]!=0)
            {
                dp[i]=min(dp[i],dp[j]+sum[i]-sum[j+mp[i-j]]);
            }

        }
       // cout<<dp[i]<<" ";
    }
    cout<<dp[k]<<endl;
    return 0;
}