Knapsack model acwing 1024. Packing problem

Backpack model AcWing 1024. Packing problem

Original link

AcWing 1024. Packing problem

Algorithm tags

DP 01 knapsack problem

Ideas

analogy 01 knapsack problem , 01 Knapsack problem has both volume and value attributes , Find the maximum value under a given volume , The problem is to find the maximum volume under a given volume , Transpose the value into volume .

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 = 20005;
// f[i] The total storage volume shall not exceed i Maximum volume at 
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 v=read();
	    Rep(j, t, v){
	        f[j]=max(f[j], f[j-v]+v);
	    }
	}
	// f[t] Is not more than t The maximum volume of , t-f[t] Minimum residual volume 
	printf("%lld", t-f[t]);
	return 0;
}

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