import java.io.IOException;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.util.Arrays;
import java.util.Scanner;
class Main
{
public static final boolean DEBUG = false;
public static final int N = 1010;
public static void main(String[] args) throws IOException
{
Scanner cin;
int t, m;
if (DEBUG) {
cin = new Scanner(new FileReader("d:\\OJ\\uva_in.txt"));
} else {
cin = new Scanner(new InputStreamReader(System.in));
}
int[] f = new int[N];
while (cin.hasNext()) {
t = cin.nextInt();
m = cin.nextInt();
int[] time = new int[m + 1];
int[] cost = new int[m + 1];
for (int i = 1; i <= m; i++) {
time[i] = cin.nextInt();
cost[i] = cin.nextInt();
}
Arrays.fill(f, 0);
for (int i = 1; i <= m; i++) {
for (int j = t; j >= time[i]; j--) {
f[j] = Math.max(f[j], f[j - time[i]] + cost[i]);
}
}
System.out.println(f[t]);
}
}
}
题目1123:采药
最新推荐文章于 2020-11-28 12:06:45 发布