(贪心)Supermarket
来源:互联网 发布:药品数据查询 编辑:程序博客网 时间:2024/06/07 18:18
A supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral number of time units starting from the moment the sale begins. Each product takes precisely one unit of time for being sold. A selling schedule is an ordered subset of products Sell ≤ Prod such that the selling of each product x∈Sell, according to the ordering of Sell, completes before the deadline dx or just when dx expires. The profit of the selling schedule is Profit(Sell)=Σ x∈Sellpx. An optimal selling schedule is a schedule with a maximum profit.
For example, consider the products Prod={a,b,c,d} with (pa,da)=(50,2), (pb,db)=(10,1), (pc,dc)=(20,2), and (pd,dd)=(30,1). The possible selling schedules are listed in table 1. For instance, the schedule Sell={d,a} shows that the selling of product d starts at time 0 and ends at time 1, while the selling of product a starts at time 1 and ends at time 2. Each of these products is sold by its deadline. Sell is the optimal schedule and its profit is 80.
Write a program that reads sets of products from an input text file and computes the profit of an optimal selling schedule for each set of products.
For example, consider the products Prod={a,b,c,d} with (pa,da)=(50,2), (pb,db)=(10,1), (pc,dc)=(20,2), and (pd,dd)=(30,1). The possible selling schedules are listed in table 1. For instance, the schedule Sell={d,a} shows that the selling of product d starts at time 0 and ends at time 1, while the selling of product a starts at time 1 and ends at time 2. Each of these products is sold by its deadline. Sell is the optimal schedule and its profit is 80.
Write a program that reads sets of products from an input text file and computes the profit of an optimal selling schedule for each set of products.
A set of products starts with an integer 0 <= n <= 10000, which is the number of products in the set, and continues with n pairs pi di of integers, 1 <= pi <= 10000 and 1 <= di <= 10000, that designate the profit and the selling deadline of the i-th product. White spaces can occur freely in input. Input data terminate with an end of file and are guaranteed correct.
For each set of products, the program prints on the standard output the profit of an optimal selling schedule for the set. Each result is printed from the beginning of a separate line.
4 50 2 10 1 20 2 30 17 20 1 2 1 10 3 100 2 8 2 5 20 50 10
80185
The sample input contains two product sets. The first set encodes the products from table 1. The second set is for 7 products. The profit of an optimal schedule for these products is 185.
这道题有点无语,看不懂英文,上博客看的题意,然后题意理解错了,然后理解题意后用的贪心,
然后代码如下,只能说是水题,该换难度了
#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>using namespace std;int n,p1,d1;struct Node{ int p; int d;}node[10010];int vis[10010];bool cmp(const Node &p1,const Node &q1){ return (p1.p>q1.p);}int main(){ while(cin>>n) { memset(vis,0,sizeof(vis)); for(int i=0;i<n;++i) { cin>>node[i].p>>node[i].d; } sort(node,node+n,cmp); int sum=0; for(int i=0;i<n;++i) if(!vis[node[i].d]) { sum+=node[i].p; vis[node[i].d]=1; } else { for(int j=node[i].d-1;j>=1;--j) { if(!vis[j]) { sum+=node[i].p; vis[j]=1; break; } } } printf("%d\n",sum); }}
0 0
- (贪心)Supermarket
- POJ-1456 Supermarket【贪心】
- POJ1456 Supermarket 贪心 DP
- poj1456 Supermarket(贪心)
- POJ 1456:Supermarket【贪心】
- nyoj 208 Supermarket(贪心)
- POJ1456 Supermarket (贪心)
- POJ-1456 Supermarket 贪心
- POJ-1456-Supermarket [贪心]
- uva 1316 - Supermarket(贪心)
- UVALive 2757Supermarket(贪心)
- POJ 1456 Supermarket hash+贪心
- uva 1316 - Supermarket(贪心)
- POJ 1456 Supermarket(贪心)
- POJ 1456 Supermarket(贪心)
- POJ-1456 Supermarket (贪心)
- Supermarket POJ 1456 (贪心)
- 贪心的一道题 Supermarket
- hdu 1043 Eight 经典八数码问题
- c语言笔记——运算符
- 魔法宝石
- 河南工业大学2017“玲珑杯”程序设计竞赛 03
- Oracle11g彻底删除
- (贪心)Supermarket
- java考题终极版
- 缓存那些事
- linux中fork
- CentOS7安装nginx+php+mysql/mariadb
- jdk1.8 新特性之 lambda表达式
- js调用函数时加括号与不加括号的区别
- request的请求参数获取方式
- Angular2踩坑之自定义Pipe管道