完全背包问题
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
while(sc.hasNext()){
int m=sc.nextInt();
int n=sc.nextInt();
int x[]=new int[n+1];
int y[]=new int[n+1];
for (int i = 1; i < y.length; i++) {
x[i]=sc.nextInt();
y[i]=sc.nextInt();
}
int h[]=new int[m+1];
for(int i=1;i<=n;i++){
for(int j=x[i];j<=m;j++){
h[j]=Math.max(h[j], h[j-x[i]]+y[i]);
}
}
System.out.println(h[m]);
}
}
}