Codeforces Round #151 (Div. 2) C. Beauty Pageant
来源:互联网 发布:通过js给html元素赋值 编辑:程序博客网 时间:2024/05/29 17:52
General Payne has a battalion of n soldiers. The soldiers' beauty contest is coming up, it will last fork 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 valueai represents the beauty of thei-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, allk 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.
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 integersa1, 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.
Print k lines: in the i-th line print the description of the detachment that will participate in the pageant on thei-th day. The description consists of integerci(1 ≤ ci ≤ n) — the number of soldiers in the detachment on thei-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.
3 31 2 3
1 11 22 3 2
2 17 12
1 12
题目大意:给你50个不相等的数,让你从中跳出K个总值不相等的组合(k <= n*(n+1)/2)
分析:排序后,从大到小,按组合中元素的个数递增构造。
#include <cstdio>#include <iostream> #include <algorithm>using namespace std;int n,k,tot,a[51];int main(){cin.sync_with_stdio(false);cin>>n>>k;for(int i = 1;i <= n;i++){cin>>a[i];}sort(a+1,a+1+n);for(int i = 1;i <= n;i++){for(int j = i;j <= n;j++){cout<<i<<" ";for(int k = 1;k <= i-1;k++) cout<<a[n-k+1]<<" ";cout<<a[n-j+1]<<endl;if(++tot == k) return 0;}}}
- Codeforces Round #151 (Div. 2) C. Beauty Pageant
- 【Codeforces 246C Beauty Pageant】
- Codeforces -【246C Beauty Pageant】
- Codeforces 246C Beauty Pageant 【构造】
- Codeforces 246C Beauty Pageant(选美大赛)
- CF 246C Beauty Pageant
- cf 151.div2 C - Beauty Pageant
- 【codeforces】Codeforces Round #370 (Div. 2) C
- 选美大赛 beauty pageant
- codeforces246C. Beauty Pageant
- Codeforces Round #151 (Div. 2)
- Codeforces Round #151 (Div. 2)
- Codeforces Round #151 (Div. 2)
- Codeforces Round #151 (Div. 2)
- Codeforces Round #151 (Div. 2)
- Codeforces Round #151 (Div. 2) A B C D
- Codeforces Round #105 (Div. 2) C
- Codeforces Round 134 div 2 C题
- 游戏生涯感想开端(一)
- nyoj 123 士兵杀敌(四)
- 238. Product of Array Except Self #Medium
- Flask 数据库多对多自引用关系
- 冒泡排序的两种写法
- Codeforces Round #151 (Div. 2) C. Beauty Pageant
- leetcode 83--Remove Duplicates from Sorted List 链表 删除元素
- 第十周第十一周项目1阅读程序(3)
- java线程同步等基础知识
- 第十一周【项目1 - 点-圆-圆柱类族的设计2】
- java3d 的学习笔记1
- 安装centos需要配置的源。
- 黑盒测试方法—因果图法
- 初学Shiro