poj_1456

Supermarket
Time Limit: 2000MS        Memory Limit: 65536K
Total Submissions: 9769        Accepted: 4219
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.

直接的贪心，每次都尽量从选择有最大的利润的，同时还可以满足条件的，自己可以模拟一下过程，比如

4  50 2  10 1   20 2   30 1，排序为<50， 2>,<30, 1>, <20, 1>, <10, 1>;选择pi = 50的，因为2这上期限没有被用掉，所以把这个时间占用，接着是<30, 1>，同理;还有一种情况，如果是<30, 2>的话，情况应该是2这个期限已经占用，所以要往前找，找到了1没有被占用，所以就占用。

#include<stdio.h>
#include<string.h>

struct product{
    int pi;
    int di;
};

struct product pro[10000];
int visit[10000];

int comp(const void *a, const void *b) {
    return (*(struct product *)b).pi - (*(struct product *)a).pi;
}

int main() {
    int t, k, i, sum;
    while(scanf("%d", &t) != EOF) {
        memset(visit, 0, sizeof(visit));
        for( i = 0; i < t; ++i) { 
            scanf("%d%d", &pro[i].pi, &pro[i].di);
        }
        qsort(pro, t, sizeof(struct product), comp);
        sum = 0;
        for(i = 0; i < t; ++i) {
            if(visit[pro[i].di] == 0) {
                visit[pro[i].di] = 1;
                sum += pro[i].pi;
            } else {
                for(k = pro[i].di - 1; k >= 1; --k) {
                    if(visit[k] == 0) {
                        visit[k] = 1;
                        sum += pro[i].pi;
                        break;
                    }
                }
            }
        }
        printf("%d\n", sum);
    }
}