The Great Wall story of Meng Jiangnv’s Bitter Weeping happened during the Qin Dynasty (221BC- 206BC). Meng jiangnv was a beauty in the Qin Dynasty, and she lived happily with her husband. At that time, Emperor Qin Shihuang (the first emperor of Qin) announced to build the Great Wall. And the officials suddenly broke in their happy life and took Meng’s husband away to build the wall. Because of the missing for her husband, she decided to set off to look for her husband. After a long journey, finally she reached the foot of the Great Wall at the present Shanhaiguan Pass. Upon her arrival, a bad news came to her, however, her husband had already died of exhaustion and was buried into the Great Wall! Meng could not help crying. She sat on the ground and cried and cried. Suddenly with a tremendous noise, a 400 kilometer-long (248-mile-long) section of the wall collapsed over her bitter wail.

Today, Qin Shihuang gets N stones. The height of the i^th stone is A_i. He will use all these stones to rebuild the Great Wall. In order to make the Great Wall more sturdy, the prime minister Li Si proposes a formula to calculate the “weakness” of the reconstructed Great Wall

         

The B_i is the height of the i^th stone in the reconstructed Great Wall, and the K is provided by Li Si.

For example, Qin Shihuang gets 5 stones. The height of these stones are [5,3,2,4,1], and the K is 2. There are 120 different ways to rebuild the Great Wall. The following figures show the two solutions:

The weakness of left figure and right figure are 4 and 11, respectively.

Now, Li Si wants to know the minimum value of “weakness”. Li Si is too old to calculate the answer quickly, so he asks you for help.

输入描述:

The first line contains an integer T, where T is the number of test cases. T test cases follow. For each test case, the first line contains two integers N and K, where N is the number of stones and K is a variable which provided by Li Si.

输出描述:

For each test case, print one line containing “Case #x: y”, where x is the test case number (starting from 1) and y is the minimum value of “weakness”.

2
5 2
1 2 3 4 5
5 3
1 3 2 2 7

Case #1: 4
Case #2: 7

备注:

For the first case, one of the best ways is [1,2,3,4,5], weakness = (2−1)+(3−2)+(4−3)+(5−4) = 4.
For the second case, one of the best ways is [7,3,2,2,1], weakness = (7−2)+(3−2)+(2−1) = 7.

#include<iostream>
#include<cstring>
#include<algorithm>
bool cmp(int x,int y)
{
    return x>y;
}
using namespace std;
int main()
{
      int t;
      cin>>t;
      int n,k;
      int a[1000];
      for(int j=0;j<t;j++)
      {
         cin>>n>>k;
      for(int i=0;i<n;i++)
          cin>>a[i];
      sort(a,a+n,cmp);//对数组进行降序排序
      int weak=0;
      for(int i=0;i<n&&i+k-1<n;i++)//每k个取最大-最小
      {
          weak+=a[i]-a[i+k-1];
      }
      cout<<"Case #"<<j+1<<": "<<weak<<endl;
      }
	return 0;
}