HDU5999-The Third Cup is Free

The Third Cup is Free

                                                                  Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
                                                                                              Total Submission(s): 667    Accepted Submission(s): 336

Problem Description

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,⋅⋅⋅,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 ≤  105 .
∙  1 ≤ pi ≤ 1000.

 

Sample Input

  
  

   
   2
3
1 2 3
5
10 20 30 20 20
  
  

 

Sample Output

  
  

   
   Case #1: 5
Case #2: 80
  
  

 

Source

2016 CCPC-Final

 

Recommend

jiangzijing2015

 

题意：有n个人喝咖啡，每个人花费Pi，每三杯最便宜的一杯免费，问最少要花多少钱

解题思路：将话费Pi从大到小排序，然后遍历一遍，免费的不加

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <bitset>
#include <set>
#include <vector>
#include <functional>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

bool cmp(int x, int y)
{
	return x > y;
}

int main()
{
	int t, cas = 0;
	scanf("%d", &t);
	while (t--)
	{
		int n, a[100008];
		scanf("%d", &n);
		for (int i = 0; i < n; i++) scanf("%d", &a[i]);
		sort(a, a + n, cmp);
		int ans = 0;
		for (int i = 0; i < n; i++)
		{
			if (i % 3 == 2) continue;
			ans += a[i];
		}
		printf("Case #%d: %d\n", ++cas, ans);
	}
	return 0;
}