UVA1153-Keep the Customer Satisfied（贪心）

Problem UVA1153-Keep the Customer Satisfied

Accept: 222  Submit: 1706
Time Limit: 3000 mSec

Problem Description

Input

The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.
Data Each test case is described by one input file that contains all the relevant data: The first line contains the number n of orders (n can be as large as 800000 for some test cases). It is followed by n lines. Each of which describes an order made of two integer values: the amount of steel (in tons) required for the order (lower than 1000) and its due date (in seconds; lower than 2×106).

Output

For each test case, you are required to compute an optimal solution and your program has to write the number of orders that are accepted. The outputs of two consecutive cases will be separated by a blank line.

 

 Sample Input

1
6
7 15
8 20
6 8
4 9
3 21
5 22

 

Sample Output

4

题解：贪心算法，首先按截至时间从小到大排序，这个比较自然，然后贪心加区间，如果能直接加进去，就先加进去，如果不能，就比较该区间的持续时间和目前算进答案的持续时间最长的区间，如果该区间持续时间短，就删去大的，加进小的，正确性还是比较明显的。

 #include <bits/stdc++.h>

 using namespace std;

 const int maxn =  + ;

 struct Work {
     int q, d;
     Work() {}
     Work(int _q, int _d) : q(_q), d(_d) {}
     bool operator < (const Work &a)const {
         if (a.d == d) return q < a.q;
         else return d < a.d;
     }
 }work[maxn];

 int n;

 int main()
 {
     //freopen("input.txt", "r", stdin);
     int iCase;
     scanf("%d", &iCase);
     bool flag = false;
     while (iCase--) {
         scanf("%d", &n);
         if (flag) printf("\n");
         flag = true;
         int cnt = ;
         for (int i = ; i < n; i++) {
             scanf("%d %d", &work[i].q, &work[i].d);
         }

         sort(work, work + n);
         int ans = , pos = ;
         priority_queue<int> que;
         for (int i = ; i < n; i++) {
             if (pos + work[i].q <= work[i].d) {
                 pos += work[i].q;
                 que.push(work[i].q);
                 ans++;
             }
             else if(!que.empty()){
                 int top = que.top();
                 if (top > work[i].q) {
                     pos += work[i].q - top;
                     que.pop();
                     que.push(work[i].q);
                 }
             }
         }
         printf("%d\n", ans);
     }
     return ;
 }