Planning(贪心)
来源:互联网 发布:下载ppt的软件 编辑:程序博客网 时间:2024/05/22 00:53
Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are n flights that must depart today, the i-th of them is planned to depart at the i-th minute of the day.
Metropolis airport is the main transport hub of Metropolia, so it is difficult to keep the schedule intact. This is exactly the case today: because of technical issues, no flights were able to depart during the first k minutes of the day, so now the new departure schedule must be created.
All n scheduled flights must now depart at different minutes between (k + 1)-th and (k + n)-th, inclusive. However, it's not mandatory for the flights to depart in the same order they were initially scheduled to do so — their order in the new schedule can be different. There is only one restriction: no flight is allowed to depart earlier than it was supposed to depart in the initial schedule.
Helen knows that each minute of delay of the i-th flight costs airport ci burles. Help her find the order for flights to depart in the new schedule that minimizes the total cost for the airport.
The first line contains two integers n and k (1 ≤ k ≤ n ≤ 300 000), here n is the number of flights, and k is the number of minutes in the beginning of the day that the flights did not depart.
The second line contains n integers c1, c2, ..., cn (1 ≤ ci ≤ 107), here ci is the cost of delaying the i-th flight for one minute.
The first line must contain the minimum possible total cost of delaying the flights.
The second line must contain n different integers t1, t2, ..., tn (k + 1 ≤ ti ≤ k + n), here ti is the minute when the i-th flight must depart. If there are several optimal schedules, print any of them.
5 24 2 1 10 2
203 6 7 4 5
Let us consider sample test. If Helen just moves all flights 2 minutes later preserving the order, the total cost of delaying the flights would be (3 - 1)·4 + (4 - 2)·2 + (5 - 3)·1 + (6 - 4)·10 + (7 - 5)·2 = 38 burles.
However, the better schedule is shown in the sample answer, its cost is (3 - 1)·4 + (6 - 2)·2 + (7 - 3)·1 + (4 - 4)·10 + (5 - 5)·2 = 20burles.
这道题主要就是一个贪心的思想,一定是让花费最大的最小,用优先队列来维护即可
#include<stdio.h>#include<queue>using namespace std;struct s{ int x; int num; friend bool operator <(s u,s v) { return u.x<v.x; }}a[300030];int ans[300030];long long result=0;int main(){ int n,k; scanf("%d%d",&n,&k); for(int i=1;i<=n;i++) { scanf("%d",&a[i].x); a[i].num=i; } priority_queue<s>q; for(int i=1;i<=k;i++) { q.push(a[i]); } for(int i=k+1;i<=k+n;i++) { if(i<=n) q.push(a[i]); s temp=q.top(); q.pop(); result+=(long long)(i-temp.num)*(long long )temp.x; ans[temp.num]=i; } printf("%I64d\n",result); for(int i=1;i<=n;i++) { if(i==1) printf("%d",ans[i]); else printf(" %d",ans[i]); } printf("\n");}
- Planning(贪心)
- Codeforces Round #433 C. Planning(贪心)
- (codeforces 853A)Planning 贪心
- CF853A Planning【贪心】
- 【POJ 3004】Subway planning(极角排序+贪心)
- Codeforces 854 C Planning(优先队列+贪心)
- Codeforces Round #433 (Div. 2) C. Planning(贪心)
- Codeforces 854C. Planning 贪心
- Codeforces 853A Planning 【贪心】
- hdu1158 Employment Planning【贪心&dp】
- Codeforces Round #433 (Div. 2, C. Planning (贪心+简单实现)
- 规划(AI Planning)
- CF854C:Planning(思维)
- Planning
- Planning
- Planning
- Planning
- Planning
- C++全排列 next_permutation
- 在ListWidget中添加自定义的Item
- java复制文件的4种方式
- Object中hashcode(),equal()方法需要重写的时期
- 数据库---操作表结构与表数据的常用sql命令
- Planning(贪心)
- 差分隐私保护技术
- c++宏定义详解
- double类型的计算
- 以二叉树的前序遍历为例,递归和非递归方式的实现
- Java多线程--ScheduledExecutorService的使用
- python基础之模块之os模块
- 内容 Selenium专题—截屏功能
- 启动服务器的时候后台没有报错,但是通过浏览器访问项目的时候报404