Contests | Virtual Contests | Problems | Submit | Runs Status | Rank List | Forum |

Time Limit: 1.0 Seconds Memory Limit: 65536K

Total Runs: 1560 Accepted Runs: 820 Multiple test files

Bessie is on a diet where she can eat no more than *C* (10 ≤ *C* ≤
35,000) calories per day. Farmer John is teasing her by putting out
*B* (1 ≤ *B* ≤ 21) buckets of feed, each with some (potentially
non-unique) number of calories (range: 1..35,000). Bessie has no
self-control: once she starts on a feed bucket, she consumes all
of it.### Input

* Line 1: Two space-separated integers: *C* and *B*### Output

* Line 1: A single line with a single integer that is largest number
of calories Bessie can consume and still stay on her diet.### Sample Input

### Sample Output

Bessie is not so good at combinatorics. Determine the optimal
combination of feed buckets that gives Bessie as many calories
without exceeding the limit *C*.

As an example, consider a limit of 40 calories and 6 buckets with 7, 13, 17, 19, 29, and 31 calories. Bessie could eat 7 + 31 = 38 calories but could eat even more by consuming three buckets: 7 + 13 + 19 = 39 calories. She can find no better combination.

* Line 2: *B* space-separated integers that respectively name the number
of calories in bucket 1, 2, etc.

40 6 7 13 17 19 29 31

39

Maintance:Fxz. Developer: SuperHacker, G.D.Retop, Fxz