poj1456
来源:互联网 发布:移动网络下载不了种子 编辑:程序博客网 时间:2024/05/23 18:33
Supermarket
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6349 Accepted: 2624
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.
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 17 20 1 2 1 10 3 100 2 8 2 5 20 50 10
Sample Output
80185
#include<iostream>#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;struct NODE{ int profit,deadline;};NODE node[10000+1];bool selected[10000+1];bool cmp(const NODE &n1,const NODE &n2){ if(n1.profit>n2.profit)return true; else { if(n1.profit<n2.profit)return false; return n1.deadline<n2.deadline; }}int main(){ int n; while(scanf("%d",&n)==1) { for(int i=1;i<=n;i++) { scanf("%d%d",&node[i].profit,&node[i].deadline); } sort(node+1,node+n+1,cmp); int sum=0; memset(selected,0,sizeof(selected)); selected[0]=0; for(int i=1;i<=n;i++) { int t=node[i].deadline; while(selected[t])t--; if(t!=0) { selected[t]=1; sum+=node[i].profit; } } printf("%d\n",sum); } return 0;}
- poj1456
- POJ1456
- poj1456
- poj1456
- poj1456-贪心
- POJ1456 Supermarket
- poj1456 - Supermarket
- poj1456(贪心)
- POJ1456 Supermarket
- POJ1456题解
- POJ1456 贪心
- poj1456 贪心
- 【poj1456 】supermarket
- poj1456 Supermarket
- POJ1456 Supermarket 贪心 DP
- poj1456--贪心策略
- POJ1456解题报告
- poj1456 Supermarket(贪心)
- fedora rpmfusion configure
- 移动硬盘故障解决1
- Android实现人人网点击“+”弹出效果
- Android 2.1 闪屏
- weblogic错误WebLogic Server is already using this directory.
- poj1456
- 关于 Java 的系统属性 sun.jnu.encoding 和 file.encoding 的区别
- poj1611
- Freemarker的内置函数及用法
- Linux下GeekOS开发流程及错误解决
- Android小经验---调试访问本地Apache方法
- 一种自动的将自定义类序列化为JSON的方法
- Linux修改时区和时间
- poj 2976 Dropping tests(01分数规划+二分)