Codeforces 1154F Shovels Shop（DP）

Shovels Shop

Shovels Shop

题意
给出n个铲子的价格，买k个铲子，给出m种折扣，折扣为如果一次买了x个物品则其中最便宜的y个物品免费赠送。
题解
将价格排序后用前缀和代表买前i个物品的总价格，dp[i]代表买i个物品的最少花费。

代码

#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <set>
#include <list>
#include <map>
#include <cmath>
#include <ctime>
//#include <bits/stdc++.h>

using namespace std;
#define me(a,b) memset(a,b,sizeof a)
#define MAX(a,b) a > b ? a : b
#define MIN(a,b) a < b ? a : b
typedef long long ll;
const int maxn = 2e5+10;
const int MOD = 10007;
const int INF = 0x3f3f3f3f;

ll dp[2010],a[maxn],sum[maxn],w[maxn],v[maxn];
ll n,m,k;
int main()
{
    while(cin>>n>>m>>k){
        me(dp,0);
        for(int i = 1; i <= n; i++){
            scanf("%lld",&a[i]);
        }
        sort(a+1,a+1+n);
        for(int i = 1; i <= m; i++){
            scanf("%lld%lld",&w[i],&v[i]);
        }
        sum[0] = 0;
        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 i = 1; i <= k; i++){
            for(int j = 1; j <= m; j++){
                if(i >= w[j]){
                    dp[i] = min(dp[i],sum[i]-sum[i-w[j]+v[j]]+dp[i-w[j]]);
                }
            }
        }
        cout<<dp[k]<<endl;
    }
    return 0;
}