wenbao与中位数

分金币

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=25&page=show_problem&problem=2275

将金币分给n个人，要求每个人的金币数相同且转移的最少

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn = 1e6+10;
#define ll long long
ll a[maxn], b[maxn], sum;
int main(){
    int n;
    while(scanf("%d", &n) == 1){
        sum = 0;
        for(int i = 1; i <= n; i++){
            scanf("%lld", &a[i]);
            sum += a[i];
        }
        sum /= n;
        b[0] = 0;
        for(int i = 1; i < n; i++){
            b[i] = b[i-1] + a[i] - sum;
        }
        sort(b, b+n);
        ll x = b[n/2], cot = 0;
        for(int i = 0; i < n; i++){
            cot += abs(x - b[i]);
        }
        printf("%lld
", cot);
    }
    return 0;
}

只有不断学习才能进步！