POJ 1456 Supermarket hash+贪心

点击打开链接

Supermarket

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 8335		Accepted: 3592

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.

Source

Southeastern Europe 2003

有n中商品，每种商品都有一个价值和卖出去的截止日期，让你安排应该怎么卖才能获得的利润最多。

贪心策略是将价值从大到小排列，然后初始化hash所存的天数都未访问过，在找的过程中，如果访问过了，就往前找，如果能找到，此物品就可以卖出去。

//460K	141MS
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
struct product
{
    int val,data;
} p[10007];
bool vis[10007];
int cmp(product a,product b)//按照利润从大到小排序
{
    if(a.val==b.val)return a.data>b.data;
    return a.val>b.val;
}
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int ans=0;
        memset(vis,0,sizeof(vis));
        for(int i=0; i<n; i++)
            scanf("%d%d",&p[i].val,&p[i].data);
        sort(p,p+n,cmp);
        for(int i=0; i<n; i++)
        {
            if(!vis[p[i].data])//如果这一天没有被访问过
            {
                ans+=p[i].val;
                vis[p[i].data]=1;
            }
            else//如果这一天被访问过了
            {
                for(int j=p[i].data-1; j>=1; j--)//从这一天的前一天开始往前找
                    if(!vis[j])//如果能够找到这么一天
                    {
                        ans+=p[i].val;//加上第i件商品的价值
                        vis[j]=1;
                        break;
                    }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}