题目:
Ivan has an array consisting of n elements. Each of the elements is an integer from 1 to n.
Recently Ivan learned about permutations and their lexicographical order. Now he wants to change (replace) minimum number of elements in his array in such a way that his array becomes a permutation (i.e. each of the integers from 1 to n was encountered in his array exactly once). If there are multiple ways to do it he wants to find the lexicographically minimal permutation among them.
Thus minimizing the number of changes has the first priority, lexicographical minimizing has the second priority.
In order to determine which of the two permutations is lexicographically smaller, we compare their first elements. If they are equal — compare the second, and so on. If we have two permutations x and y, then x is lexicographically smaller if xi < yi, where i is the first index in which the permutations x and y differ.
Determine the array Ivan will obtain after performing all the changes.
Input
The first line contains an single integer n (2 ≤ n ≤ 200 000) — the number of elements in Ivan's array.
The second line contains a sequence of integers a1, a2, ..., an (1 ≤ ai ≤ n) — the description of Ivan's array.
Output
In the first line print q — the minimum number of elements that need to be changed in Ivan's array in order to make his array a permutation. In the second line, print the lexicographically minimal permutation which can be obtained from array with q changes.
Examples
input
4 3 2 2 3
output
2 1 2 4 3
input
6 4 5 6 3 2 1
output
0 4 5 6 3 2 1
input
10 6 8 4 6 7 1 6 3 4 5
output
3 2 8 4 6 7 1 9 3 10 5
Note
In the first example Ivan needs to replace number three in position 1 with number one, and number two in position 3 with number four. Then he will get a permutation [1, 2, 4, 3] with only two changed numbers — this permutation is lexicographically minimal among all suitable.
In the second example Ivan does not need to change anything because his array already is a permutation.
题意:一段序列应该从1~n,,让1~n在序列中全部出现,并且字典序最小
题意分析:没必要用优先队列,从1到n找看有没有没被放过的
我们只需要记录哪些数没有出现过,这些数就必然会替换原来重复出现的数。
我们记录下所有重复出现的数出现的位置,从小到大去替换。
我们需要讨论的就是当前位置的数应不应当被替换。
若当前重复出现的数为x,我们打算用y去替换x。
=>若x<y,且x之前没有保留过,那么就保留当前的x。
=>若y≤x, 但只剩下最后一个x了,此时也保留x。
2 否则就贪心的替换即可。
代码:
#include<bits/stdc++.h>
#define N 2000010
using namespace std;
int n,ans=0;
int a[N],vis[N];
int main()
{
memset(vis,0,sizeof(vis));
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
vis[a[i]]++;
}
int j=1;
for(int i=1;i<=n;i++)
{
if(vis[i]==0)
{
ans++;
while(j<=n)
{
if(vis[a[j]]>1||vis[a[j]]<0)
{
if(i<a[j]||vis[a[j]]<0)
{
vis[a[j]]--;
a[j]=i;
j++;
break;
}
if(i>a[j])vis[a[j]]=-1;
}
j++;
}
}
}
printf("%d\n",ans);
for(int i=1;i<=n;i++)printf("%d ",a[i]);
return 0;
}