CodeForces--609C --Load Balancing(水题)
2016-01-12 21:38
309 查看
Load Balancing
Submit
Status
Description
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 are
mi tasks assigned to the
i-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 expression
ma - mb, where
a 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.
Input
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 the
i-th server.
Output
Print the minimum number of seconds required to balance the load.
Sample Input
Input
Output
Input
Output
Input
Output
Sample Output
Hint
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.
Source
Educational Codeforces Round 3
Time Limit: 2000MS | Memory Limit: 262144KB | 64bit IO Format: %I64d & %I64u |
Status
Description
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 are
mi tasks assigned to the
i-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 expression
ma - mb, where
a 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.
Input
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 the
i-th server.
Output
Print the minimum number of seconds required to balance the load.
Sample Input
Input
2 1 6
Output
2
Input
7 10 11 10 11 10 11 11
Output
0
Input
5 1 2 3 4 5
Output
3
Sample Output
Hint
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.
Source
Educational Codeforces Round 3
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int num[1000010]; int main() { int n; scanf("%d",&n); int sum=0; int maxx,minn; for(int i=0;i<n;i++) { scanf("%d",&num[i]); sum+=num[i]; } minn=maxx=sum/n; int ans1,ans2; ans1=ans2=0; if(sum%n) maxx++; for(int i=0;i<n;i++) { if(num[i]<minn) ans1+=minn-num[i]; else if(maxx<num[i]) ans2+=num[i]-maxx; } int s=max(ans1,ans2); printf("%d\n",s); return 0; }
相关文章推荐
- PopupWindow
- linux链接--硬链接,软链接
- 机器人操作系统ROS总结
- Java设计模式——单例设计模式
- 快速幂求余
- 附2 volatile
- 【原】模式之-适配器Adapter模式
- html之file标签 --- 图片上传前预览 -- FileReader
- hdoj Watch The Movie 3496 (二维01背包)好题
- Android permission 动态申请、授权
- 3、Java常用的运算符
- Linux进程间通信之管道
- 解决离线Could not parse configuration:hibernate.cfg.xml错误
- Android中将AS的项目导入到eclipse中,stye中常常报错
- Spring对RMI的支持
- C Primer Plus(第五版)9
- casperJs的安装
- 【java】 java 设计模式(1):工厂方法模式(Factory Method)
- C# 正则表达式
- 插入usb之后发生了什么