9 degree tutorial 101st questions

Provide group data: input: 105 1012 1116 1624 157 929 2432 255 343 3231 411 7 output: 112C source code: [cpp] # include <stdio. h> int dp [101] [1001]; typedef struct grass {int time; int worth;} grass; grass g [101]; int max (int a, int B) {return a> B? A: B;} int main () {int t, n, I, j; while (scanf ("% d", & t, & n )! = EOF) {for (I = 1; I <= n; I ++) scanf ("% d", & g [I]. time, & g [I]. worth); for (I = 0; I <= n; I ++) for (j = 0; j <= t; j ++) dp [I] [j] = 0; for (I = 1; I <= n; I ++) {for (j = 0; j <= t; j ++) {if (g [I]. time <= j) dp [I] [j] = max (dp [I-1] [j-g [I]. time] + g [I]. worth, dp [I-1] [j]); else dp [I] [j] = dp [I-1] [j];} printf ("% d \ n ", dp [n] [t]) ;}}