A7854 | Checkout Assistant
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
输入格式
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^{9}$ ). If $t_{i}$ 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
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted