Proud Merchants
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 3587 Accepted Submission(s): 1496
Problem Description
Recently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a result, the people in this country are still very proud even if their nation hasn’t been so wealthy any more.
The merchants were the most typical, each of them only sold exactly one item, the price was Pi, but they would refuse to make a trade with you if your money were less than Qi, and iSea evaluated every item a value Vi.
If he had M units of money, what’s the maximum value iSea could get?
The merchants were the most typical, each of them only sold exactly one item, the price was Pi, but they would refuse to make a trade with you if your money were less than Qi, and iSea evaluated every item a value Vi.
If he had M units of money, what’s the maximum value iSea could get?
Input
There are several test cases in the input.
Each test case begin with two integers N, M (1 ≤ N ≤ 500, 1 ≤ M ≤ 5000), indicating the items’ number and the initial money.
Then N lines follow, each line contains three numbers Pi, Qi and Vi (1 ≤ Pi ≤ Qi ≤ 100, 1 ≤ Vi ≤ 1000), their meaning is in the description.
The input terminates by end of file marker.
Each test case begin with two integers N, M (1 ≤ N ≤ 500, 1 ≤ M ≤ 5000), indicating the items’ number and the initial money.
Then N lines follow, each line contains three numbers Pi, Qi and Vi (1 ≤ Pi ≤ Qi ≤ 100, 1 ≤ Vi ≤ 1000), their meaning is in the description.
The input terminates by end of file marker.
Output
For each test case, output one integer, indicating maximum value iSea could get.
Sample Input
2 10 10 15 10 5 10 5 3 10 5 10 5 3 5 6 2 7 3
Sample Output
5 11
题意:有n件商品,每件商品的购买价格是pi元,且在购买此商品时的资金不得低于qi元,每件商品在ISea心中的价值为vi元。给出ISea的资金为m元,求能购买到的商品在ISea心中价值最大是多少。
需要排序,再直接01背包。看到一篇很好的题解:点击打开链接。
AC代码如下:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node
{
int p,q,val;
}a[510];
int cmp(node a,node b)
{
return (a.q-a.p)<(b.q-b.p);//按照qi-pi从小到大的顺序排序
}
int main()
{
int n,m,i,j;
int dp[5100];
while(scanf("%d%d",&n,&m)!=EOF)
{
for(i=0;i<n;++i)
scanf("%d%d%d",&a[i].p,&a[i].q,&a[i].val);
sort(a,a+n,cmp);
memset(dp,0,sizeof(dp));
for(i=0;i<n;++i)
{
for(j=m;j>=a[i].q;j--)
dp[j]=max(dp[j],dp[j-a[i].p]+a[i].val);
}
printf("%d\n",dp[m]);
}
return 0;
}