HDU 4864 Task(贪心,输出利润的最大值)
来源:互联网 发布:淘宝如何完成实名认证 编辑:程序博客网 时间:2024/05/21 06:44
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 2100 3100 2100 1
Sample Output
1 50004
Author
FZU
Source
2014 Multi-University Training Contest 1
Recommend
We have carefully selected several similar problems for you: 4906 4904 4903 4902 4901
解题思路:有n台机器,m个任务,每台机器有xi,yi,每个任务也有xj,yj,当一个任务可以被处理的条件是,xj<=xi 且 yj<yi,处理完产生 500*xj+2*yj 的价值,问你最多产生的价值是多少?
注意y的范围是 y<100,也就是x相差1,y不管相差多少价值都很少,x的影响更大。
根据贪心的做法,肯定从高价值物品生产也就是按x排好序,再贪心,高价值的物品只需要在x比它大的所有机器中选择y满足条件的且和任务y相差最小的那个。
#include<iostream>#include<set>#include<cstdio>#include<algorithm>using namespace std;const int maxN=110000;int n,m;struct node{ int x,y; friend bool operator < (node a,node b){ if(a.y!=b.y) return a.y<b.y; else return a.x<b.x; }}jiqi[maxN],zuoye[maxN];bool cmp(node a,node b){ if(a.x!=b.x) return a.x>b.x; else return a.y>b.y;}void solve(){ multiset<node> mul; sort(jiqi,jiqi+n,cmp); sort(zuoye,zuoye+m,cmp); int r=0,cnt=0; long long ans=0; for(int i=0;i<m;i++){ while(r<n && jiqi[r].x>=zuoye[i].x) mul.insert(jiqi[r++]);//只要求大于相应的既可以。 multiset<node>::iterator it=mul.lower_bound(zuoye[i]);//找出第一个大于等于任务b[i]的机器。 if(it!=mul.end()){ mul.erase(it); cnt++; ans+=zuoye[i].x*500+zuoye[i].y*2; } } cout<<cnt<<" "<<ans<<endl;}int main(){ while(scanf("%d%d",&n,&m)!=EOF){ for(int i=0;i<n;i++) scanf("%d%d",&jiqi[i].x,&jiqi[i].y); for(int i=0;i<m;i++) scanf("%d%d",&zuoye[i].x,&zuoye[i].y); solve(); } return 0;}
0 0
- HDU 4864 Task(贪心,输出利润的最大值)
- hdu 4864 Task(贪心)
- hdu 4864 Task(贪心)
- hdu 4864 Task (贪心)
- HDU-4864 Task(贪心)
- HDU 4864 Task(贪心)
- hdu 4864 Task (贪心)
- hdu 4864 Task 贪心
- hdu 4864 Task 贪心
- HDU 4864 Task(贪心)
- HDU 4864 Task(贪心)
- 【HDU 4864】Task【贪心】
- HDU 4864 Task 贪心
- HDU 4864 Task 贪心
- hdu 4864 Task(贪心)
- HDU 4864 Task (贪心)
- HDU 4864 Task(贪心)
- hdu 4864 Task 贪心
- 山东理工OJ【2121】数据结构实验之链表六:有序链表的建立(插排法)
- hdu 1800 Flying to the Mars (map)(暴力)
- 在 Ubuntu 14.04 Server 上安装部署 Ruby on Rails 应用
- 50道Java习题之14
- 老鼠试毒算法
- HDU 4864 Task(贪心,输出利润的最大值)
- UVA10148- Advertisement(区间选点)
- 在本机使用不同版本VS编译boost
- hdu-1203-I NEED A OFFER!
- hdu_2574 Hdu Girls' Day
- 填数问题
- jsp企业设备管理系统
- python+PyQT+Eric安装配置
- 存储过程---留住你的美丽(下)