Knapsack model acwing 423. Picking herbs

Backpack model AcWing 423. collect Chinese medicinal herbs

Original link

AcWing 423. collect Chinese medicinal herbs

Algorithm tags

DP 01 knapsack problem

Ideas

Excerpt from the solution

Code

#include<bits/stdc++.h>
#define int long long
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>=b;--i)
using namespace std;
const int N = 1005;
// f[i] The storage time is i when ,  The maximum total value of the collected herbs .
int f[N];
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
void put(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>=10) put(x/10);
    putchar(x%10^48);
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t=read(), m=read();
	int ans=0;
	rep(i, 0, m){
	    int tt=read(), v=read();
	    Rep(j, t, tt){
	        f[j]=max(f[j], f[j-tt]+v);
	    }
	}
	printf("%lld", f[t]);
	return 0;
}

Originality is not easy.
Reprint please indicate the source
If it helps you Don't forget to praise and support