贪心-B

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.

非常典型用贪心的一道题。题的大意是有个超市要卖n件商品，每件商品都有利润和最晚销售时间。求超市能获得的最大利润。
价值越大的优先考虑，所以按照价值大小降序排列，若价值相同，则按最晚销售时间降序排列。价值最大的最后卖出，以此类推。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
struct note
{
    int value;
    int time;
}a[10005];
bool cmp(note a,note b）//按照价值大小降序排列，若价值相同，则按最晚销售时间降序排列
{
    if(a.value!=b.value)
    return a.value>b.value;
    else
    return a.time>b.time;
}
int main()
{
    int n;
    int day[10005];
    while(cin>>n)
    {
        int sum=0;
        memset(day,0,sizeof(day));//记录天数有没有被占用
        for(int i=0;i<n;i++)
        cin>>a[i].value>>a[i].time;
        sort(a,a+n,cmp);
        for(int j=0;j<n;j++)
        {
            for(int k=a[j].time;k>=0;k--)//从后往前找，若没被标记，则标记改天
            {
                if(k==0)//一直找到第0天，没有则退出
                break;
                if(day[k]==0)
                {
                   day[k]=1;
                   sum+=a[j].value;
                   break;
                }
             }
        }
        cout<<sum<<endl;
    }
    return 0;
}