Java 01背包【动态规划·蓝桥杯练习题】(相信杨超越，相信锦鲤，默默努力，其它的看天意)

import java.util.Scanner;

public class Action 
{
    public static void main(String[] args) 
    {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int m = sc.nextInt();
        int[][] arr = new int[m][2];
        for (int i=0; i<m; i++)
        {
            for (int j=0; j<2; j++)
            {
                arr[i][j] = sc.nextInt();
            }
        }
        int[] temp = new int[N+1];
        for (int i=0; i<m; i++)
        {
            for (int j=N; j>0; j--)
            {
                if (j>arr[i][0])
                {
                    if (temp[j-arr[i][0]] + arr[i][0] * arr[i][1] > temp[j])
                    {
                        temp[j] = temp[j-arr[i][0]] + arr[i][0] * arr[i][1];
                    }
                    else
                        continue;
                }
            }
        }
        System.out.println(temp[N]);
    }
}