poj1456

原创 2012年03月22日 00:34:36
Supermarket
Time Limit: 2000MS   Memory Limit: 65536K
Total 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. 

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



#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;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

http://poj.org/problem?id=1456&&并查集

Description A supermarket has a set Prod of products on sale. It earns a profit px for each produ...

【POJ 1456】Supermarket

并查集应用~

Poj 1456 (并查集)(贪心)(优化队列)

这道题刚开始读错题目还以为超级水体,后来发现是一道贪心~ 可能是数据太水了,用了很简单粗暴的贪心就过了。 先贴上贪心,后面再来试别的方法好了,举一反三咯。 一共贴了三种不同的代码,前面两个是贪心,最后...

POJ - 1456 贪心+并查集

思路:按照利润排序,然后直接尽量给每个活动安排到最晚的时间即可。 AC代码 #include #include #include #include #include #include #i...

poj1456 并查集or线段树

本来做并查集专题看到的题目,但是却是用线段树A掉的。。。并查集思路一会研究下,感觉这题用线段树做挺水的。 题目给的最后期限,就相当于给了线段树查找范围,在1~d范围内找还有没有空余的点,有的话则占用,...

poj1456(贪心)

Supermarket Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 7856   Accepted: 3343...

poj 1456 Supermarket

题意:给出一些商品的清单,清单上有每个商品能获得的利润和可以出售的最后期限,卖一件商品的恰好需要一天,问能获得的最大利润是多少。感觉每次读题都好痛苦啊。。。 思路:其实是蛮简单的贪心,感觉挺好玩就写...

poj1456(贪心)

A supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold ...

POJ 1456 贪心

首先按照最晚售出时间对所有商品排序。然后从最晚售出时间最早的开始考虑。如果在之前还有时间段是空着的,那么我们就把这个商品在那个时间段出售。如果之前没有时间空着了,那么我们在前面找一个价格最小的商品,如...

POJ1456

解题思路:这个题目的思路是1:贪心+堆优化;2:贪心+并查集优化。我这里用的是并查集优化。首先是把产品按照它的利润由大到小排好序,然后依次将产品在离他的deadline最近的一天内卖出。在这里用并查集...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)