CF19B.Checkout Assistant
普及+/提高
通过率:0%
时间限制:1.00s
内存限制:256MB
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 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.
鲍勃来到一家自选商店,将 n 件商品放入购物车,然后前往收银台付款。每件商品由其价格 ci 和收银员处理该商品所需的时间 ti(单位:秒)描述。当收银员正在处理某件商品时,鲍勃可以趁机从自己的购物车中偷走其他商品;偷走一件商品恰好需要 1 秒。鲍勃最少需要向收银员支付多少钱?请注意,鲍勃可以自行决定收银员处理商品的顺序。
输入格式
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 ≤ 109). If t__i is 0, Bob won't be able to steal anything, while the checkout assistant is occupied with item i.
第一行输入包含一个数字 n(1≤n≤2000)。接下来的 n 行中,每行用一对数字 ti、ci(0≤ti≤2000,1≤ci≤109)描述一件商品。若 ti=0,则在收银员处理第 i 件商品期间,Bob 将无法窃取任何物品。
输出格式
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
输入解题思路,AI测评打分。不知道怎么写?