poj1456 Supermarket(贪心)
2016-01-30 16:41
183 查看
题意:有N件商品,分别给出商品的价值和销售的最后期限,只要在最后日期之前销售处,就能得到相应的利润,并且销售该商品需要1天时间。问销售的最大利润。
思路:贪心,将商品按最大价值排序,找到销售的最大期限,如果它的期限没有被占用,就在该天销售,如果占用,则从它的前一天开始向前查找有没有空闲的日期,如果有则占用。这样就可以得到最大销售量。
题目
Description
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.
Input
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.
Output
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.
Sample Input
Sample Output
Hint
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<cstring> #include<algorithm> using namespace std; #define maxn 10010 #define LL long long int cas=1,T; int vis[maxn]; struct node { int p; int d; }pr[maxn]; bool operator < (node a,node b) { return a.p > b.p; } int main() { int n; while (scanf("%d",&n)!=EOF) { int ans = 0; int ld = 0; memset(vis,0,sizeof(vis)); for (int i = 1;i<=n;i++) { scanf("%d%d",&pr[i].p,&pr[i].d); ld = max(ld,pr[i].d); } sort(pr+1,pr+n+1); for (int i = 1;i<=n;i++) { if (!vis[pr[i].d]) { ans+=pr[i].p; vis[pr[i].d]=1; } else { for (int j = pr[i].d-1;j>=1;j--) { if (!vis[j]) { ans+=pr[i].p; vis[j]=1; break; } } } } printf("%d\n",ans); } //freopen("in","r",stdin); //scanf("%d",&T); //printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC); return 0; }
题目
Description
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.
Input
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.
Output
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.
Sample Input
4 50 2 10 1 20 2 30 1 7 20 1 2 1 10 3 100 2 8 2 5 20 50 10
Sample Output
80 185
Hint
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.
相关文章推荐
- Java之GUI编程(一)
- Linux下靠谱的获取本机IP的C代码实
- 最近做的爬虫一些事
- 几种简单的负载均衡算法及其Java代码实现
- 正向代理和反向代理的思考
- memcache 的过期数据删除机制
- Android 开发规范
- <LeetCode OJ> 328. Odd Even Linked List
- 黑马程序员-----------class对象的获取方法
- Git研究(1)——Git使用总结
- POJ3764 The xor-longest Path(Trie树)
- Android平台下使用lua调用Java代码经验总结
- chrome开发总结(交互/权限/存储)-爬虫
- phalcon下拉列表
- Android导出数据到Excel
- SPFA_聚会
- php实现抓取淘宝商品价格人气源码
- iOS 蓝牙开发用到的一些格式转换
- 转载 VBA 操作xml
- 日期 1