Nyoj 49 开心的小明

#include <iostream>#include <cstring>using namespace std;const int MAXN1 = 30;const int MAXN2 = 30000;int main(){    int T;    int Pri[MAXN1], Im[MAXN1];    int dp[MAXN2];    int n, m;    cin>>T;    while(T--)    {        cin>>n>>m;        memset(dp, 0, sizeof(dp));        for(int i = 0; i < m; ++i)            cin>>Pri[i]>>Im[i];        for(int i = 0; i < m; ++i)        {            for(int j = n; j >= Pri[i]; --j)            {                if(dp[j] < dp[j - Pri[i]] + Pri[i] * Im[i])                    dp[j] = dp[j-Pri[i]] + Pri[i] * Im[i];            }        }        cout<<dp[n]<<endl;    }    return 0;}