版权声明:转载请附上地址 https://blog.csdn.net/weixin_44574520/article/details/89540961
luogu 1049
题目分析:
要使剩余的体积最小,就要让装入的体积最大
Code:
#include <bits/stdc++.h>
using namespace std;
#define maxv 20000
#define maxn 35
int v,n,c[maxn],f[maxv];
inline void init_() {
freopen("a.txt","r",stdin);
}
inline int read_() {
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9') {
if(c=='-') f=-1;
c=getchar();
}
while(c>='0'&&c<='9') {
x=x*10+c-'0';
c=getchar();
}
return x*f;
}
inline void clean_() {
memset(f,0,sizeof(f));
}
inline void readda_() {
clean_();
v=read_();n=read_();
for(int i=1;i<=n;i++) {
c[i]=read_();
}
}
inline void work_() {
for(int i=1;i<=n;i++) {
for(int j=v;j>=c[i];j--) {
f[j]=max(f[j],f[j-c[i]]+c[i]);
}
}
printf("%d",v-f[v]);
}
int main() {
init_();
readda_();
work_();
return 0;
}