Description
Polycarp is a music editor at the radio station. He received a playlist for tomorrow, that can be represented as a sequence a1, a2, ..., an, where ai is a band, which performs the i-th song. Polycarp likes bands with the numbers from 1 to m, but he doesn't really like others.
We define as bj the number of songs the group j is going to perform tomorrow. Polycarp wants to change the playlist in such a way that the minimum among the numbers b1, b2, ..., bm will be as large as possible.
Find this maximum possible value of the minimum among the bj (1 ≤ j ≤ m), and the minimum number of changes in the playlist Polycarp needs to make to achieve it. One change in the playlist is a replacement of the performer of the i-th song with any other group.
Input
The first line of the input contains two integers n and m (1 ≤ m ≤ n ≤ 2000).
The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109), where ai is the performer of the i-th song.
Output
In the first line print two integers: the maximum possible value of the minimum among the bj (1 ≤ j ≤ m), where bj is the number of songs in the changed playlist performed by the j-th band, and the minimum number of changes in the playlist Polycarp needs to make.
In the second line print the changed playlist.
If there are multiple answers, print any of them.
Sample Input
4 2 1 2 3 2
2 1 1 2 1 2
7 3 1 3 2 2 2 2 1
2 1 1 3 3 2 2 2 1
4 4 1000000000 100 7 1000000000
1 4 1 2 3 4
Hint
In the first sample, after Polycarp's changes the first band performs two songs (b1 = 2), and the second band also performs two songs (b2 = 2). Thus, the minimum of these values equals to 2. It is impossible to achieve a higher minimum value by any changes in the playlist.
In the second sample, after Polycarp's changes the first band performs two songs (b1 = 2), the second band performs three songs (b2 = 3), and the third band also performs two songs (b3 = 2). Thus, the best minimum value is 2
这完全就是一个阅读理解题,题意搞了半天才懂 OTZ
为了后面说明起来方便,我们先定义每个数字在数组中出现次数叫做这个数的频率,注意是次数。
题意:给出两个数字 n 和 m,再给出 n 个数字放在数组 a[i] 里。使数组 a 里面的数全部变为 1~m 之间的数字,并且使每个数的频率尽量大,也就是每个数的频率高于平均值。然后输出数组改变后所有数频率中的最小值 和 改变数组时改变了几次,以及改变后的数组。
可以知道平均值就是 n/m,然后在数组a中找到符合 1~m 的数字并记录下次数,如果高于平均值就再找下一个,低于平均值则记下差几个数能够到达平均值,这样可以求出改变次数。最后在数组中找到所有不符合条件的数【频率太小需要将频率大的改为这个数,大于m的需要变小】改掉。
#include <cstdio>
#include <cstring>
int a[2000 + 5], val[2000 + 5];
bool pos[2000 + 5];
int main()
{
int n, m;
int min_ave, min_cnt;
memset(pos, false, sizeof(pos));
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
min_ave = n/m;
min_cnt = 0;
for (int i = 1; i <= m; ++i)
{
int num = 0;
for (int j = 1; j <= n; ++j)
{
if (a[j] == i)
{
pos[j] = true;
num++;
}
if (num >= min_ave)
break;
}
if (num < min_ave)
{
val[i] = min_ave - num;
min_cnt += val[i];
}
}
int cur = 1;
for (int i = 1; i <= m; ++i)
{
for (int j = 0; j < val[i]; ++j)
{
while (pos[cur])
cur++;
a[cur++] = i;
}
}
printf("%d %d\n", min_ave, min_cnt);
for (int i = 1; i <= n; ++i)
{
printf("%d", a[i]);
if (i < n)
printf(" ");
}
printf("\n");
return 0;
}