- 标签 背包 贪心 USACO 2008
- 难度 普及/提高-
- 时空限制 1s / 128MB
Farmer John is running out of supplies and needs to purchase H (1 <= H <= 50,000) pounds of hay for his cows.
He knows N (1 <= N <= 100) hay suppliers conveniently numbered 1..N. Supplier i sells packages that contain P_i (1 <= P_i <= 5,000) pounds of hay at a cost of C_i (1 <= C_i <= 5,000) dollars. Each supplier has an unlimited number of packages available, and the packages must be bought whole.
Help FJ by finding the minimum cost necessary to purchase at least H pounds of hay.
约翰的干草库存已经告罄，他打算为奶牛们采购丹(1 <=H< =50000)镑干草.
他知道N(l<=N<=100)个干草公司，现在用1到N给它们编号.第公司卖的干草包重量 为巧P_i (1 <= P_i <= 5,000) 磅，需要的开销为C_i (1 <= C_i <= 5,000) 美元.每个干草公司的货源都十分充足， 可以卖出无限多的干草包.
Line 1: Two space-separated integers: N and H
- Lines 2..N+1: Line i+1 contains two space-separated integers: P_i and C_i
- Line 1: A single integer representing the minimum cost FJ needs to pay to obtain at least H pounds of hay.
FJ can buy three packages from the second supplier for a total cost of 9.