codeforces1077D. Cutting Out（优先队列）

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的序列，每次会从序列中删去一个选定的序列 T ，T的长度等于 k 。询问选定的 T 是什么可以使得删除的操作数尽可能多。

 

三、大致思路

首先统计每个数字在原序列中出现的次数。为了处理一个数字在序列T中可以存在多个,实际上它能被取的次数,就是在原序列中总数num除以被选择了几次ci。所以用一个优先队列记录 num/ci ，每次的队首元素就一定是最优解了。

 

四、代码

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<vector>
using namespace std;

typedef long long LL;



struct Node
{
    int val,num;
    int ci;
    bool operator < (const Node b)const
    {
        return num/ci<b.num/b.ci;
    }
}arr[200005];
int sum[200005];
int n,k;
int main()
{
    scanf("%d %d",&n,&k);
    for(int i=1;i<=n;i++)
    {
        int x;
        scanf("%d",&x);
        sum[x]++;
    }
    int cnt=0;
    priority_queue<Node>q;
    for(int i=1;i<=200000;i++)
    {
        if(sum[i]!=0)
        {
            cnt++;
            arr[cnt].num=sum[i];
            arr[cnt].val=i;
            arr[cnt].ci=1;
            q.push(arr[cnt]);
        }
    }
    vector<int>ans;
    while(ans.size()<k)
    {
        Node t=q.top();
        q.pop();
        ans.push_back(t.val);
        t.ci++;
        q.push(t);
    }
    for(int i=0;i<ans.size();i++)
        printf("%d ",ans[i]);
    return 0;
}