2466. Hay For Sale

单点时限: 2.0 sec

内存限制: 256 MB

Farmer John suffered a terrible loss when giant Australian cockroaches ate the entirety of his hay inventory, leaving him with nothing to feed the cows. He hitched up his wagon with capacity C (1 <= C <= 50,000) cubic units and sauntered over to Farmer Don’s to get some hay before the cows miss a meal.

Farmer Don had a wide variety of H (1 <= H <= 5,000) hay bales for sale, each with its own volume (1 <= V_i <= C). Bales of hay, you know, are somewhat flexible and can be jammed into the oddest of spaces in a wagon.

FJ carefully evaluates the volumes so that he can figure out the largest amount of hay he can purchase for his cows.

Given the volume constraint and a list of bales to buy, what is the greatest volume of hay FJ can purchase? He can’t purchase partial bales, of course. Each input line (after the first) lists a single bale FJ can buy.

输入格式

  • Line 1: Two space-separated integers: C and H

  • Lines 2..H+1: Each line describes the volume of a single bale: V_i

输出格式

  • Line 1: A single integer which is the greatest volume of hay FJ can

purchase given the list of bales for sale and constraints.

样例

Input
7 3
2
6
5
INPUT DETAILS:
The wagon holds 7 volumetric units; three bales are offered for sale with
volumes of 2, 6, and 5 units, respectively.
Output
7
OUTPUT DETAILS:
Buying the two smaller bales fills the wagon.

20 人解决,26 人已尝试。

55 份提交通过,共有 112 份提交。

4.4 EMB 奖励。

创建: 10 年,11 月前.

修改: 2 年,5 月前.

最后提交: 1 年,2 月前.

来源: USACO 2008 DEC

题目标签