超级会员免费看
[USACO08NOV] Buying Hay S（完全背包问题）
题目描述
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.
约翰的干草库存已经告罄，他打算为奶牛们采购 H ( 1 ≤ H ≤
订阅专栏 解锁全文
103
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
