usaco_score inflation

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.)
/* ID: yinguan1 PROG: inflate LANG: C++ */#include using namespace std; int Ti,C; int T[10000],S[10000],MAX[10001]; int main() { ifstream fin("inflate.in"); ofstream fout("inflate.out"); fin>>Ti>>C; for(int i=0; i>S[i]>>T[i]; for(int i=0; i=0) if(MAX[j]#include #include #include #include #define MAXCAT 10000 #define MAXTIME 10000 int best[MAXTIME+1]; void main(void) { FILE *fin, *fout; int tmax, ncat; int i, j, m, p, t; fin = fopen("inflate.in", "r"); fout = fopen("inflate.out", "w"); assert(fin != NULL && fout != NULL); fscanf(fin, "%d %d", &tmax, &ncat); for(i=0; i best[j+t]) best[j+t] = best[j]+p; } m = 0; for(i=0; i<=tmax; i++) if(m < best[i]) m = best[i]; fprintf(fout, "%d/n", m); exit(0); }
#include ifstream fin("inflate.in"); ofstream fout("inflate.out"); const short maxm = 10010; long best[maxm], m, n; void main() { short i, j, len, pts; fin >> m >> n; for (j = 0; j <= m; j++) best[j] = 0; for (i = 0; i < n; i++) { fin >> pts >> len; for (j = len; j <= m; j++) if (best[j-len] + pts > best[j]) best[j] = best[j-len] + pts; } fout << best[m] << endl;//This is always the highest total. }