Proud Merchants
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 3686 Accepted Submission(s): 1541
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
Author
iSea @ WHU
Source
嗯,题目大意就是说,一个物品价格为p,价值为v,但是只有当你所有的金额大于q时别人才会与你交易,问所能购买的物品的最大总价值
先按q和p的差值从小到大排序即可。
#include <iostream>
#include<cstdio>
#include<cstring>
#define maxn 550
#include<algorithm>
using namespace std;
int f[5050];
struct node
{
int p,q,v;
};
node s[maxn];
int cmp(node a,node b)
{
return a.q-a.p<b.q-b.p;
}
int max(int a,int b)
{
return a>b?a:b;
}
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m))
{
for(int i=0;i<n;++i)
scanf("%d%d%d",&s[i].p,&s[i].q,&s[i].v);
sort(s,s+n,cmp);
/* for(int i=0;i<n;++i)
printf("%d %d %d\n",s[i].p,s[i].q,s[i].v);*/
memset(f,0,sizeof(f));
for(int i=0;i<n;++i)
{
for(int j=m;j>=s[i].q;j--)
{
f[j]=max(f[j],f[j-s[i].p]+s[i].v);
}
}
printf("%d\n",f[m]);
}
return 0;
}