# CodeForces 19B Checkout Assistant

B. Checkout Assistant

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 priceci and time ti 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 tici(0 ≤ ti ≤ 2000, 1 ≤ ci ≤ 109). If ti 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.

Examples

input

```4
2 10
0 20
1 5
1 3```

output

`8`

input

```3
0 1
0 10
0 100```

output

`111`
`简单01背包，每个物品的付钱时间可以当作是买了这个物品还可以送你多少个物品。物品的数量相当于背包的体积，物品的价值相当于价值，问题就变成求背包体积大于等于n时，可以得到的最小价值`
```#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <stdio.h>
#include <math.h>

using namespace std;
const long long int MAX=(long long int)1<<62;
long long int dp[2005];
long long int a[2005][2];
int n;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%lld%lld",&a[i][0],&a[i][1]),a[i][0]++;
for(int i=0;i<=n;i++)
dp[i]=MAX;
dp[0]=0;
for(int i=1;i<=n;i++)
{
for(int j=n;j>=0;j--)
{
if(j>=a[i][0])
{
dp[j]=min(dp[j],dp[j-a[i][0]]+a[i][1]);
}
else
dp[j]=min(dp[j],a[i][1]);
}
}
printf("%lld\n",dp[n]);
return 0;
}```

0 条评论

• ### ZOJ 3946 Highway Project(Dijkstra)

Highway Project ---- Time Limit: 2 Seconds      Memory Limit: 65536 KB ---- Edwa...

• ### HOJ 2139 Spiderman's workout（动态规划）

Spiderman’s workout My Tags (Edit) Source : Nordic Collegiate Programming ...

• ### POJ-2353 Ministry（动态规划）

Ministry Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 476...

• ### Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)&&Codeforces 861C Did yo

C. Did you mean... time limit per test：1 second memory limit per test：256 megaby...

• ### HDUOJ---Piggy-Bank

Piggy-Bank Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K...

• ### C++ 隐式类型转换

C++定义了一组内置类型对象之间的转换标准，在必要的时候它们被编译器隐式的转换 1、任何两种或多种类型的数据和变量混合操作的时候，最宽的数据类型成为目标转换类型...

• ### hdu---1024Max Sum Plus Plus(动态规划)

Max Sum Plus Plus Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/...

• ### HDU-1003 Max Sum(动态规划，最长字段和问题)

Max Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (J...

• ### 算法-斐波那契数列

题目： 写一个函数，输入为n，求斐波那契（Fibonacci）数列的第n项。斐波那契数列定义如下： ? 解题思路： 斐波那契问题是个非常经典的递归...

• ### 01.WebService_基础知识

01.WebService_基础知识 WebService基础学习(一)—基础知识 一、WebService 1.什么是WebService Web ...