Educational Codeforces Round 3 C. Load Balancing
来源:互联网 发布:怎么查找淘宝卖家电话 编辑:程序博客网 时间:2024/05/17 22:11
In the school computer room there are n servers which are responsible for processing several computing tasks. You know the number of scheduled tasks for each server: there aremi tasks assigned to thei-th server.
In order to balance the load for each server, you want to reassign some tasks to make the difference between the most loaded server and the least loaded server as small as possible. In other words you want to minimize expressionma - mb, wherea is the most loaded server and b is the least loaded one.
In one second you can reassign a single task. Thus in one second you can choose any pair of servers and move a single task from one server to another.
Write a program to find the minimum number of seconds needed to balance the load of servers.
The first line contains positive number n (1 ≤ n ≤ 105) — the number of the servers.
The second line contains the sequence of non-negative integers m1, m2, ..., mn (0 ≤ mi ≤ 2·104), where mi is the number of tasks assigned to thei-th server.
Print the minimum number of seconds required to balance the load.
21 6
2
710 11 10 11 10 11 11
0
51 2 3 4 5
3
In the first example two seconds are needed. In each second, a single task from server #2 should be moved to server #1. After two seconds there should be 3 tasks on server #1 and 4 tasks on server #2.
In the second example the load is already balanced.
A possible sequence of task movements for the third example is:
- move a task from server #4 to server #1 (the sequence m becomes: 2 2 3 3 5);
- then move task from server #5 to server #1 (the sequence m becomes: 3 2 3 3 4);
- then move task from server #5 to server #2 (the sequence m becomes: 3 3 3 3 3).
The above sequence is one of several possible ways to balance the load of servers in three seconds.
改了好久才过的题,一定要注意细节。
#include <cstdio>#include <iostream>using namespace std;int n,sum,ans,a[100001],ans2;int main(){scanf("%d",&n);for(int i=1;i <= n;i++){scanf("%d",&a[i]);sum+=a[i];}int average=sum/n;for(int i=1;i <= n;i++) if(a[i] > average) { ans+=a[i]-average; ans2++; }if(sum % n != 0) printf("%d\n",ans-min(ans2,sum-average*n));else printf("%d\n",ans);}
- Educational Codeforces Round 3 C. Load Balancing
- Codeforces Educational Codeforces Round 3 C. Load Balancing(贪心)
- Educational Codeforces Round 3 C.Load Balancing(模拟)
- Educational Codeforces Round 3 609C Load Balancing(脑洞)
- 【Educational Codeforces Round 3 C】【贪心 排序】Load Balancing 最小操作步数使得数字之差尽可能小
- Codeforces 609C Load Balancing
- CodeForces 609C Load Balancing
- CodeForces 609C Load Balancing
- Codeforces 609C Load Balancing
- CodeForces 609C Load Balancing
- CodeForces 609C-C. Load Balancing
- Educational Codeforces Round 3
- Codeforces Educational Round 3
- Educational Codeforces Round 21 C
- Educational Codeforces Round 5 C
- Educational Codeforces Round 26 C
- codeforces 603 C. Load Balancing 贪心
- Codeforces 609C Load Balancing 【水题】
- JS表格组件神器bootstrap table详解(基础版)
- UIScrollView上的控件处理touch事件
- MySQL数据库MyISAM和InnoDB存储引擎的比较
- html页面中查找元素 css
- 应用HTK搭建语音拨号系统--创建单音素HMM模型
- Educational Codeforces Round 3 C. Load Balancing
- UIScrollView的作用原理,实现scrollView中touch事件作用子视图
- cjson源码剖析(1)
- UIScrollView的delaysContentTouches与canCencelContentTouches属性
- 给键盘添加一个工具条
- nginx安装和配置
- 数据库关于group by 两个或以上条件的分析
- mysql命令一些常用的选项
- poj1815