Hay For Sale

问题 A: Hay For Sale

时间限制: 1 Sec   内存限制: 12 MB
提交: 175   解决: 39
[ 提交][ 状态][ 讨论版]

题目描述

Farmer John suffered a terrible loss when giant Australian cockroaches ate the entirety of his hay inventory, leaving him with nothing to feed the cows. He hitched up his wagon with capacity C (1 <= C <=  50,000) cubic units and sauntered over to Farmer Don's to get some hay before the cows miss a meal. 

Farmer Don had a wide variety of H (1 <= H <= 5,000) hay bales for sale, each with its own volume (1 <= V_i <= C). Bales of hay, you know, are somewhat flexible and can be jammed into the oddest of spaces in a wagon. 

FJ carefully evaluates the volumes so that he can figure out the largest amount of hay he can purchase for his cows. 

Given the volume constraint and a list of bales to buy, what is the greatest volume of hay FJ can purchase? He can't purchase partial bales, of course. Each input line (after the first) lists a single bale FJ can buy. 

输入

* Line 1: Two space-separated integers: C and H 

* Lines 2..H+1: Each line describes the volume of a single bale: V_i 

输出

* Line 1: A single integer which is the greatest volume of hay FJ can purchase given the list of bales for sale and constraints. 

样例输入

7 3
2
6
5

样例输出

7

使用01背包法做：

#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
	int num, c;
	cin >> c >> num;
	int *v = new int[num+1];
	for (int i = 1; i <=num; i++)
	{
		cin >> v[i];
	}
	int *dp = new int[c+1];
	memset(dp, 0, (c+1)*sizeof(int));
	
		

	for (int i = 1; i <= num; i++)
	{
		for (int j = c; j >= v[i]; j--)
			dp[j] = max(dp[j], dp[j - v[i]] + v[i]);
		if (dp[c] == c)
			i = num;
	}
	


	cout << dp[c]<<endl;

	delete []v;
	delete []dp;
	
	return 0;
}