UVA - 1153 Keep the Customer Satisfied（贪心）

UVA - 1153

Keep the Customer Satisfied

Time Limit: 3000MS

Memory Limit: Unknown

64bit IO Format: %lld & %llu

Description

 

Simon and Garfunkel Corporation (SG Corp.) is a large steel-making company with thousand of customers. Keeping the customer satisfied is one of the major objective of Paul and Art, the managers.

Customers issue orders that are characterized by two integer values q<tex2html_verbatim_mark> , the amount of steel required (in tons) and d<tex2html_verbatim_mark> , the due date (a calender date converted in seconds). The due date has to be met if SG Corp. accepts the order. Stated another way, when an order is accepted, the corresponding amount of steel has to be produced before its due date. Of course, the factory can process no more than one order at a time.

Although the manufacturing process is rather complex, it can be seen as a single production line with a constant throughput. In the following, we assume that producing q<tex2html_verbatim_mark> tons of steel takes exactly q<tex2html_verbatim_mark> seconds (i.e., throughput is 1). The factory runs on a monthly production plan. Before the beginning of the month, all customers' orders are collected and Paul and Art determine which of them are going to be accepted and which ones are to be rejected in the next production period. A production schedule is then designed. To keep customers satisfied, Paul and Art want to minimize the total number of orders that are rejected. In the following, we assume that the beginning of the next production plan (i.e., the first day of the next month) corresponds to date 0.

Hogdson and Moore have been appointed as Chief Scientific Officers and you are requested to help them to compute an optimal solution and to build a schedule of all accepted orders (starting time and completion time).

Small Example

Consider the following data set made of 6 orders J₁,..., J₆<tex2html_verbatim_mark> . For a given order, J_j<tex2html_verbatim_mark> , q_j<tex2html_verbatim_mark> denotes the amount of steel required and d_j<tex2html_verbatim_mark> is the associated due date.

Order	qj<tex2html_verbatim_mark>	dj<tex2html_verbatim_mark>
J1<tex2html_verbatim_mark>	6	8
J2<tex2html_verbatim_mark>	4	9
J3<tex2html_verbatim_mark>	7	15
J4<tex2html_verbatim_mark>	8	20
J5<tex2html_verbatim_mark>	3	21
J6<tex2html_verbatim_mark>	5	22

You can check by hand that all orders cannot be accepted and it's very unlikely you could find a solution with less than two rejected orders. Here is an optimal solution: Reject J₁<tex2html_verbatim_mark> and J₄<tex2html_verbatim_mark> , accept all other orders and process them as follows.

Accepted Order	Starting Time	Completion Time
J2<tex2html_verbatim_mark>	0	4
J3<tex2html_verbatim_mark>	4	11
J5<tex2html_verbatim_mark>	11	14
J6<tex2html_verbatim_mark>	14	19

Note that the production line is never idle.

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<tex2html_verbatim_mark> of orders ( n<tex2html_verbatim_mark> can be as large as 800000 for some test cases). It is followed by n<tex2html_verbatim_mark> 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 x 10⁶<tex2html_verbatim_mark> ).

Output

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.

You are required to compute an optimal solution and your program has to write the number of orders that are accepted.

Sample Input

1

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

Sample Output

4

Some Hints from Hogdson and Moore

• Hogdson and Moore claim that it is optimal to sequence accepted orders in non-decreasing order of due dates.
• They also claim that there is an optimal solution such that for any two orders J_u<tex2html_verbatim_mark> and J_v<tex2html_verbatim_mark> with q_u > q_v<tex2html_verbatim_mark> and d_u < d_v<tex2html_verbatim_mark> , if J_u<tex2html_verbatim_mark> is accepted then J_v<tex2html_verbatim_mark> is also accepted.
• Finally, Hogdson and Moore advise you to ``Keep the Customer Satisfied"

Keep the Customer Satisfied

Gee but it's great to be back home
Home is where I want to be.
I've been on the road so long my friend,
And if you came along
I know you couldn't disagree.

It's the same old story
Everywhere I go,
I get slandered,
Libeled,
I hear words I never heard
In the bible
And I'm on step ahead of the shoe shine
Two steps away from the county line
Just trying to keep my customers satisfied,
Satisfied.

Deputy sheriff said to me
Tell me what you come here for, boy.
You better get your bags and flee.
You're in trouble boy,
And you're heading into more.

©Simon & Garfunkel

解题报告： 题中基本告诉我们怎么做这题了。首先按照截止时间的先后排序。对于任意两个任务a和b，如果a的截止时间在b之前，且a的加工时间比b长，那么接受了a订单必然要接受b订单。反过来呢，如果b的加工时间超过了截止时间，那么就找之前的订单，删掉加工时间最长的那个订单。这样接受的订单数没有变化，而总的加工时间变短了，为以后接受更多订单做准备。总要拒绝一些订单的，所以用优先队列维护q

代码：

#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<cstdio>
using namespace std;
struct node
{
    int q;
    int d;
};
node a[];
int cmp(node x,node y)
{
    return x.d<y.d;
}
int main()
{
    int t,n;;
    cin>>t;
    while(t--)
    {
        scanf("%d",&n);
        priority_queue<int>p;
        for(int i=; i<n; i++)
            scanf("%d%d", &a[i].q, &a[i].d);
        sort(a,a+n,cmp);
        int total=;int s;
        for(int i=; i<n; i++)
        {
            if(a[i].q+total<=a[i].d)
            {
                p.push(a[i].q);
                total+=a[i].q;
            }
            else if(!p.empty())
            {
                s=p.top();
                if(s>a[i].q)
                {
                    total=total-s+a[i].q;
                    p.pop();
                    p.push(a[i].q);
                }
            }
        }
        printf("%d\n",p.size());
        if(t) cout<<endl;
    }
    return ;
}

借鉴别人博客的，更简练的程序

#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<cstdio>
using namespace std;
struct node
{
    int q;
    int d;
};
node a[];
int cmp(node x,node y)
{
    return x.d<y.d;
}
int main()
{
    int t,n;;
    cin>>t;
    while(t--)
    {
        scanf("%d",&n);
        priority_queue<int>p;
        for(int i=; i<n; i++)
            scanf("%d%d", &a[i].q, &a[i].d);
        sort(a,a+n,cmp);
        int total=;int k=;
        for(int i=; i<n; i++)
        {
            total+=a[i].q;
            p.push(a[i].q);
            if(total>a[i].d)
            {
                total-=p.top();
                p.pop();
                k++;
            }

        }
        printf("%d\n",n-k);
        if(t) cout<<endl;
    }
    return ;
}