poj 1252 Euro Efficiency（完全背包）

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

const int MAXN = 5000;
const int INF = 0x3f3f3f3f;
int dp[MAXN+1];
int coins[6];

int main()
{
int T;
scanf("%d",&T);
while(T--)
{
memset(dp,0x3f,sizeof(dp));
dp[0] = 0;
for(int i = 0; i < 6; ++i)
scanf("%d",&coins[i]);
for(int i = 0; i < 6; ++i)
for(int j = coins[i]; j <= MAXN; ++j)
dp[j] = min(dp[j-coins[i]]+1,dp[j]);

for(int i = 0; i < 6; ++i)
for(int j = MAXN-coins[i]; j >= 0; --j)
dp[j] = min(dp[j],dp[j+coins[i]]+1);
double sum = 0;
int res = 0;
for(int i = 1; i <= 100; ++i)
{
sum += dp[i];
res = max(res,dp[i]);
}
printf("%.2f %d\n",sum/100.0,res);
}
return 0;
}