### USACO help

Posted:

**Fri Nov 12, 2004 2:38 am**I need help with one of the test cases with the problem inflate.

Here's the problem description if anyone needs it:
thanks for your help

and btw, does anyone know what happened to ioiforum.org?

Here's the problem description if anyone needs it:

Here is the test case I am having trouble with. Since it's really long and complicated, it's hard for me to try and figure out how it works.Score Inflation

The more points students score in our contests, the happier we here at the USACO are. We try to design our contests so that people can score as many points as possible, and would like your assistance.

We have several categories from which problems can be chosen, where a "category" is an unlimited set of contest problems which all require the same amount of time to solve and deserve the same number of points for a correct solution. Your task is write a program which tells the USACO staff how many problems from each category to include in a contest so as to maximize the total number of points in the chosen problems while keeping the total solution time within the length of the contest.

The input includes the length of the contest, M (1 <= M <= 10,000) (don't worry, you won't have to compete in the longer contests until training camp) and N, the number of problem categories, where 1 <= N <= 10,000.

Each of the subsequent N lines contains two integers describing a category: the first integer tells the number of points a problem from that category is worth (1 <= points <= 10000); the second tells the number of minutes a problem from that category takes to solve (1 <= minutes <= 10000).

Your program should determine the number of problems we should take from each category to make the highest-scoring contest solvable within the length of the contest. Remember, the number from any category can be any nonnegative integer (0, one, or many). Calculate the maximum number of possible points.

PROGRAM NAME: inflate

INPUT FORMAT

Line 1: M, N -- contest minutes and number of problem classes

Lines 2-N+1: Two integers: the points and minutes for each class

SAMPLE INPUT (file inflate.in)

300 4

100 60

250 120

120 100

35 20

OUTPUT FORMAT

A single line with the maximum number of points possible given the constraints.

SAMPLE OUTPUT (file inflate.out)

605

(Take two problems from #2 and three from #4.)

Code: Select all

```
minutes problems
1000 20
points minutes
40 11
333 336
2172 356
1958 537
9499 701
4443 275
6983 109
416 565
8155 166
7644 686
9596 828
4268 220
8396 953
8109 924
6048 452
5998 662
7201 550
4062 114
6713 122
4911 475
```

and btw, does anyone know what happened to ioiforum.org?