HDU - 5999 The Third Cup is Free

最新推荐文章于 2021-08-05 00:02:50 发布

Joey丶sunk

最新推荐文章于 2021-08-05 00:02:50 发布

阅读量393

点赞数 1

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

版权

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#include <sstream>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
using namespace std;
const int maxn = 100000 + 7;
int T, n;
int a[maxn];

bool cmp(int a, int b) {
    return a > b;
}

int main() {
    scanf("%d", &T);
    int kase = 1;
    while(T--) {
        scanf("%d", &n);
        int sum = 0;
        for(int i = 1; i <= n; ++i) {
            scanf("%d", &a[i]);
            sum += a[i];
        }
        sort(a+1, a+n+1, cmp);
        for(int i = 1; i <= n; ++i) {
            if(i % 3 == 0) sum -= a[i];
        }
        printf("Case #%d: %d\n", kase++, sum);
        //cout << sum << endl;
    }


    return 0;
}