//2603599 2011-07-28 16:26:51 Accepted 2883 C++ 50 180 ylwh!
#include <stdio.h>
#include <algorithm>
using namespace std;
bool cmp(int a, int b)
{
return a>b ? 1: 0;
}
int main()
{
int t, n, a[20001], i, j, ans;
scanf("%d", &t);
while(t--)
{
ans = 0;
j = 2;
scanf("%d", &n);
for(i=0; i<n; i++)
scanf("%d", &a[i]);
sort(a, a+n, cmp);
while(j<n)
{
ans += a[j];
j += 3;
}
printf("%d\n", ans);
}
return 0;
}
zoj 2883 Shopaholic
最新推荐文章于 2017-01-11 16:42:35 发布