Codeforces Round #521 (Div. 3) D. Cutting Out 【二分+排序】

任意门：http://codeforces.com/contest/1077/problem/D

D. Cutting Out

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an array ss consisting of nn integers.

You have to find any array tt of length kk such that you can cut out maximum number of copies of array tt from array ss.

Cutting out the copy of tt means that for each element titi of array tt you have to find titi in ss and remove it from ss. If for some titi you cannot find such element in ss, then you cannot cut out one more copy of tt. The both arrays can contain duplicate elements.

For example, if s=[1,2,3,2,4,3,1]s=[1,2,3,2,4,3,1] and k=3k=3 then one of the possible answers is t=[1,2,3]t=[1,2,3]. This array tt can be cut out 22 times.

• To cut out the first copy of tt you can use the elements [1,2––,3,2,4,3––,1––][1,2_,3,2,4,3_,1_] (use the highlighted elements). After cutting out the first copy of tt the array ss can look like [1,3,2,4][1,3,2,4].
• To cut out the second copy of tt you can use the elements [1––,3––,2––,4][1_,3_,2_,4]. After cutting out the second copy of tt the array ss will be [4][4].

Your task is to find such array tt that you can cut out the copy of tt from ss maximum number of times. If there are multiple answers, you may choose any of them.

Input

The first line of the input contains two integers nn and kk (1≤k≤n≤2⋅1051≤k≤n≤2⋅105) — the number of elements in ss and the desired number of elements in tt, respectively.

The second line of the input contains exactly nn integers s1,s2,…,sns1,s2,…,sn (1≤si≤2⋅1051≤si≤2⋅105).

Output

Print kk integers — the elements of array tt such that you can cut out maximum possible number of copies of this array from ss. If there are multiple answers, print any of them. The required array tt can contain duplicate elements. All the elements of tt (t1,t2,…,tkt1,t2,…,tk) should satisfy the following condition: 1≤ti≤2⋅1051≤ti≤2⋅105.

Examples

input

Copy

7 3
1 2 3 2 4 3 1

output

Copy

1 2 3

input

Copy

10 4
1 3 1 3 10 3 7 7 12 3

output

Copy

7 3 1 3

input

Copy

15 2
1 2 1 1 1 2 1 1 2 1 2 1 1 1 1

output

Copy

1 1

Note

The first example is described in the problem statement.

In the second example the only answer is [7,3,1,3][7,3,1,3] and any its permutations. It can be shown that you cannot choose any other array such that the maximum number of copies you can cut out would be equal to 22.

In the third example the array tt can be cut out 55 times.

题意概括：

在长度为N的序列中找出K个元素的子序列，满足这个子序列在序列中最多（子序列 不要求有序，连续）；

解题思路：

一开始的思想：记录每种数出现的次数，按照降序排序，高出现次数的补低出现次数的，贪心最大化最小值。（wa，代码实现不好）

二分+排序（其实看到要最大化最小值就应该想到了的。。。）

排序还是记录原N序列的每种数的出现次数，按照降序排序；

二分最低出现的次数，判断条件是以这个最低标准是否能填充满 子序列 K。

AC code：

 #include <cstdio>
 #include <iostream>
 #include <algorithm>
 #include <cstring>
 #define LL long long
 using namespace std;
 const int MAXN = 1e6+;
 LL sum, mx, x;
 int K, N, ct, cnt;
 int ans[MAXN], ans0, an[MAXN];
 int l = , r;
 int p[MAXN];

 struct date
 {
     int num, t;
 }a[MAXN];

 bool cmp(date a, date b)
 {
     return a.t > b.t;
 }

 bool judge(int tms)
 {
     cnt = ;
     for(int i = ; i <= ct; i++){
         int tmp = a[i].t;
         if(tmp < tms) break;        //因为已经排序过了
         while(tmp >= tms){
             tmp-=tms;
             ans[++cnt] = a[i].num;
         }
     }
     return cnt>=K;
 }

 int main()
 {
     scanf("%d%d", &N, &K);
     r = N;
     for(int i = ; i <= N; i++){
         scanf("%d", &x);
         if(mx < x) mx = x;
         p[x]++;
     }
     for(int i = ; i <= mx; i++){
         if(p[i]){
             a[++ct].num = i;
             a[ct].t = p[i];
         }
     }
     sort(a+, a++ct, cmp);
     int mid;
     while(l<=r){
         mid = (l+r)>>;
         if(judge(mid)){
             an[] = ;
             for(int i = ; i <= cnt; i++){
                 an[++an[]] = ans[i];
                 l = mid+;
             }
         }
         else r = mid-;
     }
     for(int i = ; i <= K; i++){
         printf("%d ", an[i]);
     }
     puts("");
     return ;
 }