HBC24979[网络流24题]运输问题[USACO 2008 Nov S]Buying Hay题解

想要检验自己的编程水平？来试试全网最全C++题库，让您在挑战中不断进步。

Farmer John is running out of supplies and needs to purchase H (1

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 Pi (1 <= Pi <= 5,000) pounds of hay at a cost of Ci (1 <= Ci <= 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.

不断学习，不断挑战，才能在编程领域中脱颖而出！全网最全C++题库，助您成为编程高手！

标签： HBC24979[网络流24题]运输问题[USACO 2008 Nov S]Buying Hay题解