CF19B.Checkout Assistant
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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 ci 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.
输入格式
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 ti , ci ( 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 one number — answer to the problem: what is the minimum amount of money that Bob will have to pay.
输入输出样例
输入#1
4 2 10 0 20 1 5 1 3
输出#1
8
输入#2
3 0 1 0 10 0 100
输出#2
111