Task
Problem Description
Today the company has m tasks to complete. The ith task need xi minutes to complete. Meanwhile, this task has a difficulty level yi. The machine whose level below this task’s level yi cannot complete this task. If the company completes this task, they will get (500*xi+2*yi) dollars.
The company has n machines. Each machine has a maximum working time and a level. If the time for the task is more than the maximum working time of the machine, the machine can not complete this task. Each machine can only complete a task one day. Each task can only be completed by one machine.
The company hopes to maximize the number of the tasks which they can complete today. If there are multiple solutions, they hopes to make the money maximum.
The company has n machines. Each machine has a maximum working time and a level. If the time for the task is more than the maximum working time of the machine, the machine can not complete this task. Each machine can only complete a task one day. Each task can only be completed by one machine.
The company hopes to maximize the number of the tasks which they can complete today. If there are multiple solutions, they hopes to make the money maximum.
Input
The input contains several test cases.
The first line contains two integers N and M. N is the number of the machines.M is the number of tasks(1 < =N <= 100000,1<=M<=100000).
The following N lines each contains two integers xi(0<xi<1440),yi(0=<yi<=100).xi is the maximum time the machine can work.yi is the level of the machine.
The following M lines each contains two integers xi(0<xi<1440),yi(0=<yi<=100).xi is the time we need to complete the task.yi is the level of the task.
The first line contains two integers N and M. N is the number of the machines.M is the number of tasks(1 < =N <= 100000,1<=M<=100000).
The following N lines each contains two integers xi(0<xi<1440),yi(0=<yi<=100).xi is the maximum time the machine can work.yi is the level of the machine.
The following M lines each contains two integers xi(0<xi<1440),yi(0=<yi<=100).xi is the time we need to complete the task.yi is the level of the task.
Output
For each test case, output two integers, the maximum number of the tasks which the company can complete today and the money they will get.
Sample Input
1 2 100 3 100 2 100 1
Sample Output
1 50004
解题思路:先将机器和任务以x为第一关键字y为第二关键字从大到小排序,然后用任务去匹配机器。当然,一个任务可能可以由几台机器完成,我们要记录满足x值的机器,然后再从这些机器中选择y值最小的,这样才能保证方案最优(类似于田忌赛马),证明略。
代码如下:
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn = 100005;
const int maxm = 100005;
struct node
{
int x;
int y;
};
node machine[maxn],task[maxm];
int work[105];
int cmp(node a,node b)
{
if(a.x == b.x)
return a.y > b.y;
return a.x > b.x;
}
int main()
{
int n,m;
while(scanf("%d %d",&n,&m) != EOF){
for(int i = 0;i < n;i++){
scanf("%d %d",&machine[i].x,&machine[i].y);
}
for(int i = 0;i < m;i++){
scanf("%d %d",&task[i].x,&task[i].y);
}
sort(machine,machine + n,cmp);
sort(task,task + m,cmp);
long long ans = 0;
int res = 0;
int i,j,k;
memset(work,0,sizeof(work));
for(i = 0,j = 0;i < m;i++){
while(j < n && machine[j].x >= task[i].x){
work[machine[j].y]++;
j++;
}
for(k = task[i].y;k < 101;k++){
if(work[k]){
work[k]--;
res++;
ans += 500 * task[i].x + 2 * task[i].y;
break;
}
}
}
printf("%d %I64d\n",res,ans);
}
return 0;
}