cf-723C Polycarp at the Radio
分析:先定义每个数字在数组中出现次数叫做这个数的频率,注意是次数。
题意:给出两个数字 n 和 m,再给出 n 个数字放在数组 a[i] 里。使数组 a 里面的数全部变为 1~m 之间的数字,并且使每个数的频率尽量大,也就是每个数的频率高于平均值。然后输出数组改变后所有数频率中的最小值 和 改变数组时改变了几次,以及改变后的数组。
可以知道平均值就是 n/m,然后在数组a中找到符合 1~m 的数字并记录下次数,如果高于平均值就再找下一个,低于平均值则记下差几个数能够到达平均值,这样可以求出改变次数。最后在数组中找到所有不符合条件的数【频率太小需要将频率大的改为这个数,大于m的需要变小】改掉
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.
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.
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.
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
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.
#include<iostream>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=2050;
int a[N],val[N],p[N];
int pos[2005];
int main(){
int n,m,min_ave,min_cnt;
memset(pos,0,sizeof(pos));
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>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]=1;
num++;
}
if(num>=min_ave){
break;
}
}
if(num<min_ave){
val[i]=min_ave-num;
min_cnt+=val[i];
}
}
int count=1;
for(int i=1;i<=m;i++){
for(int j=0;j<val[i];j++){
while(pos[count]==1){
count++;
}
a[count++]=i;
}
}
cout<<min_ave<<" "<<min_cnt<<endl;
for(int i=1;i<=n;i++){
cout<<a[i]<<" ";
}
cout<<endl;
return 0;
}