HDOJ2955(01背包 强制转换)(WA）

#include <iostream> 
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <math.h>
#include<iostream>
#include <map>

using namespace std;
#define INF  0xfffff;//0x代表十六进制
#define M 110

struct aaa
{
	double mj;
	int pj;
}a[M];

double dp[M];

int main()
{
	int t;
	cin >> t;
	for (int i = 1; i <= t; i++)
	{
		memset(dp, 0, sizeof(dp));
		double p;
		int n;
		cin >> p >> n;
		p *= 100;
		for (int i = 0; i < n; i++)
		{
			double b;
			cin >> a[i].mj >> b;
			a[i].pj = b * 100;
		}
		for(int i=0;i<n;i++)
			for (int j = (int)p; j >= a[i].pj; j--)
			{
				dp[j] = max(dp[j], dp[j - a[i].pj] + a[i].mj);
			}
		cout << dp[(int)p] << endl;
	}
}