【CODEFORCES】 B. Design Tutorial: Learn from Life
来源:互联网 发布:淘宝买家差评怎么回复 编辑:程序博客网 时间:2024/05/20 04:32
One way to create a task is to learn from life. You can choose some experience in real life, formalize it and then you will get a new task.
Let's think about a scene in real life: there are lots of people waiting in front of the elevator, each person wants to go to a certain floor. We can formalize it in the following way. We have n people standing on the first floor, the i-th person wants to go to the fi-th floor. Unfortunately, there is only one elevator and its capacity equal to k (that is at most k people can use it simultaneously). Initially the elevator is located on the first floor. The elevator needs |a - b| seconds to move from the a-th floor to the b-th floor (we don't count the time the people need to get on and off the elevator).
What is the minimal number of seconds that is needed to transport all the people to the corresponding floors and then return the elevator to the first floor?
The first line contains two integers n and k (1 ≤ n, k ≤ 2000) — the number of people and the maximal capacity of the elevator.
The next line contains n integers: f1, f2, ..., fn (2 ≤ fi ≤ 2000), where fi denotes the target floor of the i-th person.
Output a single integer — the minimal time needed to achieve the goal.
3 22 3 4
8
4 250 100 50 100
296
10 32 2 2 2 2 2 2 2 2 2
8
In first sample, an optimal solution is:
- The elevator takes up person #1 and person #2.
- It goes to the 2nd floor.
- Both people go out of the elevator.
- The elevator goes back to the 1st floor.
- Then the elevator takes up person #3.
- And it goes to the 2nd floor.
- It picks up person #2.
- Then it goes to the 3rd floor.
- Person #2 goes out.
- Then it goes to the 4th floor, where person #3 goes out.
- The elevator goes back to the 1st floor.
这题千万不要被Note误导了,不要从小到大,从大到小就好,代码就是分分钟的事....
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int n,k,m,a[2005];void qsort(int a[],int low,int high){ int i=low,j=high,t=a[(low+high)/2]; while (i<j) { while (a[i]<t) i++; while (a[j]>t) j--; if (i<=j) { int k; k=a[i]; a[i]=a[j]; a[j]=k; i++; j--; } } if (i<high) qsort(a,i,high); if (j>low) qsort(a,low,j);}int main(){ scanf("%d%d",&n,&k); for (int i=1;i<=n;i++) scanf("%d",&a[i]); qsort(a,1,n); int i,v,p,ans=0; i=n; while (i>=1) { ans+=(a[i]-1)*2; v=k; p=a[i]; while (i>=1 && v>0) { i--; v--; } } cout <<ans<<endl; return 0;}
- 【CODEFORCES】 B. Design Tutorial: Learn from Life
- Codeforces 472B - Design Tutorial: Learn from Life(模拟)
- codeforces-#472B. Design Tutorial: Learn from Life(贪心)
- Codeforces Round #270--B. Design Tutorial: Learn from Life
- codeforces 之 Design Tutorial: Learn from Life
- B. Design Tutorial: Learn from Life
- Codeforces #270 B. Design Tutorial: Learn from Life(数据结构:优先队列模拟题)
- Codeforces 472B. Design Tutorial: Learn from Life(坐电梯扯淡题)
- codeforce 472B. Design Tutorial: Learn from Life
- CF 270 B - Design Tutorial: Learn from Life
- cf472B Design Tutorial: Learn from Life
- Codeforces Design Tutorial: Learn from Math
- codeforces 472BDesign Tutorial: Learn from Life(简单贪心)
- codeforces 472A. Design Tutorial: Learn from Math
- codeforces-#472A. Design Tutorial: Learn from Math
- codeforces 472A Design Tutorial: Learn from Math
- cf472A Design Tutorial: Learn from Math
- A. Design Tutorial: Learn from Math
- DIV最小高度且自适应高度
- poj 1321 棋盘问题 (简单的DFS)
- 字符串的翻转
- 百度地图SDK2.4.1 中实现路径规划
- 蒙特卡洛法(随即取样法) 数模 笔记
- 【CODEFORCES】 B. Design Tutorial: Learn from Life
- linux sed命令详解
- Linux和window下tomcat虚拟路径的配置方式
- 从输入任意个整型数,统计其中的负数个数并求所有非负数的平均值
- Java经典算法的实现(一)-----希尔排序
- 托管态update更新异常——a different object with the same identifier value was already associated withthe sess
- javascript设计模式的学习
- 文章标题
- 如果统计的个数相同,则按照ASII码由小到大排序输出 。如果有其他字符,则对这些字符不用进行统计。