HDU 5835 Danganronpa

最新推荐文章于 2019-01-01 21:35:16 发布

Joey丶sunk

最新推荐文章于 2019-01-01 21:35:16 发布

阅读量199

点赞数 1

本文链接：https://blog.csdn.net/xiang_6/article/details/77197742

版权

emmmmm 不知道该说啥

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <cstdio>
#include <cstdlib>

using namespace std;
const int maxn = 10 + 7;
int T, n, ans;
int a[maxn];

void init() {
    scanf("%d", &n);
    int sum = 0;
    for(int i = 0; i < n; ++i) {
        scanf("%d", &a[i]);
        sum += a[i];
    }
    ans = sum / 2;
    sort(a, a+n);
    for(int i = n-1; i > 0; --i)
        a[i] = a[i] - a[i-1];
}

void solve() {
    int t = n;
    int num = 0;
    for(int i = 0; i < n-1; ++i) {
        num += (a[i] * t);
        t--;
    }
    if(a[n-1]) num++;
    ans = min(ans, num);
    cout << ans << endl;
}

int main() {
    scanf("%d", &T);
    int kase = 1;
    while(T--) {
        init();
        printf("Case #%d: ", kase++);
        solve();
    }

    return 0;
}