HDU - 5999 The Third Cup is Free 贪心

The Third Cup is Free

Panda and his friends were hiking in the forest. They came across a coffee bar inside a giant tree trunk.
Panda decided to treat everyone a cup of coffee and have some rest. Mr. Buck, the bartender greeted Panda and his animal friends with his antler. He proudly told them that his coffee is the best in the forest and this bar is a Michelin-starred bar, thats why the bar is called Starred Bucks.
There was a campaign running at the coffee bar: for every 3 cups of coffee, the cheapest one is FREE. After asking all his friends for their flavors, Panda wondered how much he need to pay.

Input

The first line of the input gives the number of test cases, T.
T test cases follow. Each test case consists of two lines. The first line contains one integer N, the number of cups to be bought.
The second line contains N integers p1,p2,・・・,pNp1,p2,・・・,pN representing the prices of each cup of coffee.

Output

For each test case, output one line containing “Case #x: y”, where x is the test case number (starting from 1) and y is the least amount of money Panda need to pay.
limits

∙∙ 1 ≤ T ≤ 100.
∙∙ 1 ≤ N ≤ 10⁵.
∙∙ 1 ≤ pi ≤ 1000.

Sample Input

2
3
1 2 3
5
10 20 30 20 20

Sample Output

Case #1: 5
Case #2: 80

这个应该算贪心算法里的基础题吧，为了得到最小值，那么也就是说每次免费我们都要争取到最大的价值，但是又是三杯里面最便宜的一杯免费。
所以实现超简单的啦，排序，从最大的开始，加两个，忽略一个，加两个，忽略一个，完事。

代码

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int coffee[100000];
int main()
{
    int n,m,k;
    scanf("%d",&m);
    for(k=0;k<m;){
        scanf("%d",&n);
        int i,j=n-n/3,temp,sum=0;
        for(i=0;i<n;++i){
            scanf("%d",&coffee[i]);
        }
        sort(coffee,coffee+n);
        for(i=n-1,j=1;i>=0;--i,++j){
            if(j%3){
                sum+=coffee[i];
            }
        }
        printf("Case #%d: %d\n",++k,sum);
    }
}