hdu6000 wash （优先队列+贪心）

Wash

Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 64000/64000 K (Java/Others)
Total Submission(s): 2045    Accepted Submission(s): 544

Problem Description

Mr.Panda is about to engage in his favourite activity doing laundry! He’s brought L indistinguishable loads of laundry to his local laundromat, which has N washing machines and M dryers.The  ith washing machine takes  Wi minutes to wash one load of laundry, and the  ith dryer takes Di minutes to dry a load of laundry.
At any point in time, each machine may only be processing at most one load of laundry.
As one might expect, Panda wants to wash and then dry each of his L loads of laundry. Each load of laundry will go through the following steps in order:
1. A non-negative amount of time after Panda arrives at the laundromat, Panda places the load in an unoccupied washing machine i.
2. Wi minutes later, he removes the load from the washing machine, placing it in a temporary holding basket (which has unlimited space)
3. A non-negative amount of time later, he places the load in an unoccupied dryer j 
4. Dj minutes later, he removes the load from the dryer Panda can instantaneously add laundry to or remove laundry from a machine. Help Panda minimize the amount of time (in minutes after he arrives at the laundromat) after which he can be done washing and drying all L loads of laundry!

 

Input

The first line of the input gives the number of test cases, T.
T test cases follow. Each test case consists of three lines. The first line contains three integer L, N, and M.
The second line contains N integers  W1,W2,...,WN representing the wash time of each wash machine.
The third line contains M integers  D1,D2,...,DM representing the dry time of each dryer.

 

Output

For each test case, output one line containing “Case #x: y”, where x is the test case number (starting from 1) and y is the minimum time it will take Panda to finish his laundry.

limits

∙1≤T≤100.
∙1≤L≤106.
∙1≤N,M≤105.
∙1≤Wi,Di≤109.

 

Sample Input

2 1 1 1 1200 34 2 3 2 100 10 1 10 10

 

Sample Output

Case #1: 1234 Case #2: 12

 

Source

2016 CCPC-Final

 

题意：有l件衣服，n个洗衣机，m个烘干机，接下来会告诉你n个洗衣机的洗衣时间，m个烘干机的烘干时间，每个时间段只能处理一件衣服，问最小的时间洗完所有衣服。

思路：贪心的策略就是你先可以求出来洗完衣服的最早时间，那么我们拿最后洗好的衣服最早烘干。就是用最大值加最小值的方法来贪心，当然烘干要用最短时间那个烘干机。

#include<stdio.h>
#include<queue>
#include<string.h>
#include<algorithm>
using namespace std;
#define ll long long
struct node
{
    ll x,y;
    friend bool operator<(node a1,node b1)
    {
        return a1.x>b1.x;//小值优先级高
    }
}a;
priority_queue<node>q1,q2;
ll aa[1000005];
int main()
{
    int t;
    int casee=0;
    ll l,n,m;
    scanf("%d",&t);
    while(t--)
    {
        while(!q1.empty()) q1.pop();
        while(!q2.empty()) q2.pop();
        scanf("%lld%lld%lld",&l,&n,&m);
        for(int i=0;i<n;i++)//全放进优先队列自动排序
        {
            scanf("%lld",&a.x);
            a.y=a.x;
            q1.push(a);
        }
        for(int i=0;i<m;i++)
        {
            scanf("%lld",&a.x);
            a.y=a.x;
            q2.push(a);
        }
        for(int i=0;i<l;i++)
        {
            a=q1.top();
            q1.pop();
            aa[i]=a.x;//记录洗衣时间，求出来最晚洗完的那个
            a.x+=a.y;//因为每个时间段只能洗一件衣服，那么我们第一个洗衣机用过以后在用的时候要累加上次洗的时间
            q1.push(a);
        }
        ll ans=0;
        for(int i=l-1;i>=0;i--)
        {
            a=q2.top();
            q2.pop();
            ans=max(ans,a.x+aa[i]);
            a.x+=a.y;//烘干同洗衣一样
            q2.push(a);
        }
        printf("Case #%d: ",++casee);
        printf("%lld\n",ans);
    }
}