hdu_2191_二进制优化

#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
#pragma warning(disable:4996)
#include<cstdio>
#include<cstdlib>
using std::cin;
using std::cout;
using std::endl;
using std::stringstream;
using std::string;
using std::vector;
using std::list;
using std::pair;
using std::set;
using std::multiset;
using std::map;
using std::multimap;
using std::stack;
using std::queue;
using std::priority_queue;
class Rice
{
public:
	int price,weight,amount;
	Rice()
	{
		price = weight = amount = 0;
	}
	Rice(const int &p, const int &w, const int &a)
	{
		price = p, weight = w, amount = a;
	}
};
int main()
{
	//freopen("input.txt", "r", stdin);  
	//freopen("output.txt", "w", stdout);  
	int T;
	while (cin >> T)
	{
		while (T--)
		{
			int kind, fund;
			cin >> fund >> kind;
			vector<Rice>rice;
			for (int i = 0; i < kind; i++)
			{
				int price, weight, amount; cin >> price >> weight >> amount;
				rice.push_back({ price,weight,amount });
			}
			vector<pair<int, int>>item;
			for (int i = 0; i < kind; i++)
			{
				for (int j = 1; j <= rice[i].amount; rice[i].amount -= j, j *= 2)
				{
					item.push_back({rice[i].price*j,rice[i].weight*j});
				}
				if (rice[i].amount)
				{
					item.push_back({ rice[i].price*rice[i].amount,rice[i].weight*rice[i].amount });
				}
			}
			vector<int>dp(fund + 1);
			for (int i = 0; i < item.size(); i++)
			{
				for (int j = fund; j >= item[i].first; j--)
				{
					dp[j] = std::max(dp[j], dp[j - item[i].first] + item[i].second);
				}
			}
			cout << dp[fund] << endl;
		}
	}
	return 0;
}