nyoj 208 Supermarket
来源:互联网 发布:不知道阿里云的账号 编辑:程序博客网 时间:2024/04/29 17:34
Supermarket
时间限制:1000 ms | 内存限制:65535 KB
难度:4
- 描述
- 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.
- 输入
- 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
- 来源
- POJ
- 上传者
- iphxer
以前好像做过,,,
这几天一直在水,,,,状态不好了,,,,,
就是从贵的开始,每个让它在最后一天卖,,这样就可以为后面比它小的且比它卖的时间短的留出时间。。。。
代码:
#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>using namespace std;int n;struct node{int pp,dd;}shangpin[10010];bool cmp(node xx,node yy){return xx.pp>yy.pp;}bool fafe[10010];int main(){while (~scanf("%d",&n)){for (int i=0;i<n;i++)scanf("%d%d",&shangpin[i].pp,&shangpin[i].dd);sort(shangpin,shangpin+n,cmp);int s=0;memset(fafe,true,sizeof(fafe));for (int i=0;i<n;i++){for (int j=shangpin[i].dd;j>=1;j--){if (fafe[j]){s+=shangpin[i].pp;fafe[j]=false;break;}}}printf("%d\n",s);}return 0;}
0 0
- nyoj 208 Supermarket
- nyoj 208 Supermarket(贪心)
- NYOJ 208 Supermarket (贪心 && 并查集)
- Supermarket
- Supermarket
- Supermarket
- Supermarket
- Supermarket
- Supermarket
- Supermarket
- Supermarket
- Supermarket Equipment
- pku1456 Supermarket
- zoj1731-Supermarket
- POJ1456 Supermarket
- poj1456 - Supermarket
- NYOJ208 Supermarket
- toj1681 Supermarket
- 关于httputlConnection与form表单提交数据的区别
- Opengl备忘2--绘制三角形
- 【BFS】POJ 2251
- SQLServer下的用户自定义函数的语法格式、编写实例以及调用方法
- mac 下卸载android studio
- nyoj 208 Supermarket
- 数据库连接池原理
- 利用“bash on windows”安装配置emscripten
- POJ 3984 迷宫问题(BFS)
- 正则表达式总结
- Intent传递数据时,可以传递哪些类型数据?
- infobright
- 【BZOJ1561】[JSOI2009]去括号【表达式相关】
- 算法导论 练习 2.3-6