# 洛谷P2925 [USACO08DEC]干草出售Hay For Sale

## 题目描述

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.

```7 3
2
6
5 ```

`7 `

## 说明

The wagon holds 7 volumetric units; three bales are offered for sale with volumes of 2, 6, and 5 units, respectively.

Buying the two smaller bales fills the wagon.

1811 篇文章123 人订阅

0 条评论

## 相关文章

### Spark MLlib 之 aggregate和treeAggregate从原理到应用

16300

Shuffling is a procedure used to randomize a deck of playing cards. Because sta...

9010

27050

### Java企业微信开发_02_通讯录同步

登录企业微信—>管理工具—>通讯录同步助手—>开启“API接口同步”  ; 开启后，即可看到通讯录密钥，也可设置通讯录API的权限：读取或者编辑通...

1K20

### RavenDb学习（七) 异步工作以及维度查询

1、异步执行 var entity = new Company {Name = "Async Company #2", Id = "companies/2"}...

30650

33130

38260

30550

### FZU 2099 魔法阵（计算几何）

Problem 2099 魔法阵 Accept: 120    Submit: 289 Time Limit: 1000 mSec    Memory L...

29530

### 【Kotlin 反应式编程】第1讲 你好，Reactive Programming

【Kotlin 反应式编程】第1讲 你好，Reactive Programming

9620