CF-19B - Checkout Assistant(DP)

最新推荐文章于 2022-05-21 18:04:58 发布

原创最新推荐文章于 2022-05-21 18:04:58 发布 · 646 阅读

0 ·

CC 4.0 BY-SA版权

DP 专栏收录该内容

107 篇文章

订阅专栏

本文探讨了一个在杂货店结账时通过合理安排商品顺序来最小化付款金额的问题。通过分析每个商品的购买时间与所需支付的价格，提出了一种优化策略，旨在在最短时间内完成结账并最小化总支出。

B - Checkout Assistant

Crawling in process...Crawling failedTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 19B

Description

Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is described by its price c_i and time t_i in seconds that a checkout assistant spends on this item. While the checkout assistant is occupied with some item, Bob can steal some other items from his trolley. To steal one item Bob needs exactly 1 second. What is the minimum amount of money that Bob will have to pay to the checkout assistant? Remember, please, that it is Bob, who determines the order of items for the checkout assistant.

Input

The first input line contains number n (1 ≤ n ≤ 2000). In each of the following n lines each item is described by a pair of numbers t_i, c_i (0 ≤ t_i ≤ 2000, 1 ≤ c_i ≤ 10⁹). If t_i is 0, Bob won't be able to steal anything, while the checkout assistant is occupied with item i.

Output

Output one number — answer to the problem: what is the minimum amount of money that Bob will have to pay.

Sample Input

Input

Output

Input

Output

思路：简单01背包，不过要注意优化，就是题目中有说偷的时间只要1秒，所以当时间大于n秒时，他可以都所以物品，因此只要更新到 n就可以得到正确答案了。

仔细想想，记忆化搜索好像也行。

#include<iostream>
#include<algorithm>
#include<cstring>
#include<map>
using namespace std;
const long long oo=1e18;
const int mm=2005;
long long f[mm];
int m,x;
long long y,z;
int main()
{
  while(cin>>m)
  {
    f[0]=0;
    for(int i=1;i<mm;i++)
      f[i]=oo;
    for(int i=0;i<m;i++)
    {cin>>x>>y;
      int mid;
      for(int j=m;j>=0;j--)
      {
        if(j+x+1<m)mid=j+x+1;///时间大于m时，他可以偷所有物品因此只需到m就行
        else mid=m;
        if(f[j]+y<f[mid])///更新值
          f[mid]=f[j]+y;
      }
    }
    cout<<f[m]<<"\n";
  }
}