Codeforces 246C Beauty Pageant 【构造】

题目链接：Codeforces 246C Beauty Pageant

C. Beauty Pageant
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
General Payne has a battalion of n soldiers. The soldiers’ beauty contest is coming up, it will last for k days. Payne decided that his battalion will participate in the pageant. Now he has choose the participants.

All soldiers in the battalion have different beauty that is represented by a positive integer. The value ai represents the beauty of the i-th soldier.

On each of k days Generals has to send a detachment of soldiers to the pageant. The beauty of the detachment is the sum of the beauties of the soldiers, who are part of this detachment. Payne wants to surprise the jury of the beauty pageant, so each of k days the beauty of the sent detachment should be unique. In other words, all k beauties of the sent detachments must be distinct numbers.

Help Payne choose k detachments of different beauties for the pageant. Please note that Payne cannot just forget to send soldiers on one day, that is, the detachment of soldiers he sends to the pageant should never be empty.

Input
The first line contains two integers n, k (1 ≤ n ≤ 50; 1 ≤ k ≤  ) — the number of soldiers and the number of days in the pageant, correspondingly. The second line contains space-separated integers a1, a2, …, an (1 ≤ ai ≤ 107) — the beauties of the battalion soldiers.

It is guaranteed that Payne’s battalion doesn’t have two soldiers with the same beauty.

Output
Print k lines: in the i-th line print the description of the detachment that will participate in the pageant on the i-th day. The description consists of integer ci (1 ≤ ci ≤ n) — the number of soldiers in the detachment on the i-th day of the pageant and ci distinct integers p1, i, p2, i, …, pci, i — the beauties of the soldiers in the detachment on the i-th day of the pageant. The beauties of the soldiers are allowed to print in any order.

Separate numbers on the lines by spaces. It is guaranteed that there is the solution that meets the problem conditions. If there are multiple solutions, print any of them.

Examples
input
3 3
1 2 3
output
1 1
1 2
2 3 2
input
2 1
7 12
output
1 12

题意：n个数，每天可以选任意个数(每个数一天只能选一次)，选k天，使得每天的和不同。

一开始以为是神题，发现n个数全不相同——SB题。

思路：我们先取n个数，然后从最大的开始取，每次取前k大的数，剩余的数每次加一个，发现每次的和都是不同的，每次可以得到n - i个数，这样有n * (n + 1) - n * (n + 1) / 2个数 >= k。直接暴力即可。

AC代码：

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#define CLR(a, b) memset(a, (b), sizeof(a))
using namespace std;
typedef long long LL;
const int MAXN = 1e6 +10;
const int INF = 0x3f3f3f3f;
bool cmp(int x, int y) {
    return x > y;
}
int a[60], ans[60];
int main()
{
    int n, k;
    while(scanf("%d%d", &n, &k) != EOF) {
        int cnt = 0; int use = 0;
        for(int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
        }
        sort(a+1, a+n+1, cmp); bool flag = false;
        while(flag == false) {
            use++;
            for(int i = use; i <= n; i++) {
                printf("%d", use);
                for(int j = 1; j <= use - 1; j++) {
                    printf(" %d", a[j]);
                }
                printf(" %d\n", a[i]);
                cnt++;
                if(cnt == k) {
                    flag = true; break;
                }
            }
        }
    }
    return 0;
}