题目很简单,看懂了背包九讲,敲个模版,再找最小值就可以了。
ACcode:
#include<stdio.h>
#include<iostream>
using namespace std;
const int size=100;
int a,b,n,m,k,s,i,j,temp;
int dp[size][size];
int search()
{
for (i=0;i<=m;i++)
{
if (dp[i][s]>=n) return m-i;
}
return -1;
}
int main()
{
while (~scanf("%d %d %d %d",&n,&m,&k,&s))
{
for (i=0;i<=m;i++) for (j=0;j<=s;j++) dp[i][j]=0;
while (k--)
{
scanf("%d %d",&a,&b);
for (i=b;i<=m;i++)
{
for (j=1;j<=s;j++)
{
temp=dp[i-b][j-1]+a;
dp[i][j]=temp>dp[i][j]?temp:dp[i][j];
}
}
}
printf("%d\n",search());
}
return 0;
}