poj 1456 supermarket
2016-02-01 16:55
323 查看
Supermarket
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.
Source
Southeastern Europe 2003
利用优先数列写的,详细解释可参照我的博客里面的杭电1789
#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;
struct node
{
int day;
int price;
}t[11000];
bool cmp(node a,node b)
{
if(a.day==b.day)
return a.price>b.price;
return a.day<b.day;
}
bool operator <(const node&a,const node &b )
{
return a.price>b.price;
}
int i,j,k,l,m,n,p;
int main()
{
while(scanf("%d",&p)!=EOF)
{
for(i=0;i<p;i++)
scanf(" %d%d",&t[i].price,&t[i].day);
sort(t,t+p,cmp);
priority_queue<node>q;
int help=1;
int sum=0;
for(i=0;i<p;i++)
{
if(t[i].day>=help)
{
help++;
q.push(t[i]);
sum+=t[i].price;
}
else
{
node temp=q.top();
if(temp.price<t[i].price)
{
q.pop();
q.push(t[i]);
sum-=temp.price;
sum+=t[i].price;
}
}
}
printf("%d\n",sum);
}
}
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 10844 | Accepted: 4760 |
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.
Source
Southeastern Europe 2003
利用优先数列写的,详细解释可参照我的博客里面的杭电1789
#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;
struct node
{
int day;
int price;
}t[11000];
bool cmp(node a,node b)
{
if(a.day==b.day)
return a.price>b.price;
return a.day<b.day;
}
bool operator <(const node&a,const node &b )
{
return a.price>b.price;
}
int i,j,k,l,m,n,p;
int main()
{
while(scanf("%d",&p)!=EOF)
{
for(i=0;i<p;i++)
scanf(" %d%d",&t[i].price,&t[i].day);
sort(t,t+p,cmp);
priority_queue<node>q;
int help=1;
int sum=0;
for(i=0;i<p;i++)
{
if(t[i].day>=help)
{
help++;
q.push(t[i]);
sum+=t[i].price;
}
else
{
node temp=q.top();
if(temp.price<t[i].price)
{
q.pop();
q.push(t[i]);
sum-=temp.price;
sum+=t[i].price;
}
}
}
printf("%d\n",sum);
}
}
相关文章推荐
- 正益移动王国春当选“2015中国互联网+最具创新力年度人物”
- 最基本的网页爬虫(数据采集)
- 自定义视图注意点
- Android中使用SurfaceView和Canvas来绘制动画
- Android:自己定义输入法(输入password时防止第三方窃取)
- 游戏服务端究竟解决了什么问题?
- SQL修改字段默认值
- HTML5 使用sessionStorage实现页面返回刷新
- JQuery 解决 鼠标快速滑过后,会执行多次滑出的问题
- 修改百度地图默认显示厦门
- Python使用socket实现简单的文件传输并校验
- left join on and 与 left join on where的区别
- android *** Layout 08 AutoCompleteTextView && Adapter
- Java动态代理的实现机制
- 【java基础】Minor GC、Major GC和Full GC之间的区别
- 得到sd卡图片的方法总结
- No DEFAULT or UI configuration directive found!
- memcached注意事项与应用范围、应用条件、限制
- java.lang.IllegalArgumentException: Document base D:\apache-tomcat-6.0.20\webapps\XXX错误
- 1020. Tree Traversals (25)