POJ

来源：互联网发布：凤凰金融以大数据为编辑：程序博客网时间：2024/06/05 23:49

#include<iostream>#include<algorithm>#include<string>#include<cstring>#include<map>#include<queue>#include<cmath>#include<stack>#include<vector>#include<cstdio>#define MAXN 33000#define INF 0x3f3f3f3f#define lmid l,m,rt<<1#define rmid m+1,r,rt<<1|1#define ls rt<<1#define rs rt<<1|1#define Mod 1000000007#define i64 __int64#define LIMIT_ULL 100000000000000000using namespace std;int dp[50000];int v[20],w[20];int main(){     int t;     scanf("%d",&t);     while(t--)     {          int n,m,year;          scanf("%d%d%d",&m,&year,&n);          for(int i=0;i<n;i++)          {               scanf("%d%d",&v[i],&w[i]);               v[i]/=1000;          }          for(int y=1;y<=year;y++)          {               int sum=m/1000;               memset(dp,0,sizeof(dp));               for(int i=0;i<n;i++)                    for(int j=v[i];j<=sum;j++)                    dp[j]=max(dp[j],dp[j-v[i]]+w[i]);               m+=dp[sum];          }          cout<<m<<endl;     }     return 0;}

阅读全文

0 0