The Third Cup is Free

最新推荐文章于 2026-07-02 11:07:50 发布

原创最新推荐文章于 2026-07-02 11:07:50 发布 · 688 阅读

本内容遵循CC 4.0 BY-SA版权协议

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 ≤ 105105 .
∙∙ 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

#include

#include

using namespace std;

int a[100005];

bool cmp(int a, int b)

{

 return a > b;

}

int main()

{

 int T,cnt = 1,N,sum;

 cin >> T;

 while (T--)

 {

  scanf("%d", &N);

  for (int i = 1; i <=N; i++)

   scanf("%d", &a[i]);

  sort(a+1, a + N+1,cmp);

  sum = 0;

  for (int i = 1; i <=N; i++)

  {

   if (i % 3 == 0)

    continue;

    sum += a[i];

  }

  cout << "Case #" << cnt++ << ": "<<sum << endl;

 }

 return 0;

}