Codeforces Round #436 (Div. 2) D. Make a Permutation!

http://codeforces.com/contest/864/problem/D

Description

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.

Sample Input

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

Hint

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.

题意

求用最少的修改次数使得序列变成一个n的排列，在这个前提下使得字典序最小

题解

先标记一下各个数字出现的次数，再标记一下各个数字是否出现，从第一个数字开始遍历，如果一个数出现过多次，且最小的没有出现的数字比此数小，那么我们就更新这个数。

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int N=200000;
#define inf 0x3f3f3f3f
int flag[N+5],a[N+5],visit[N+5];
int main()
{
    int n,ans=0;
    cin>>n;
    for(int i=1; i<=n; i++)
    {
        cin>>a[i];
        flag[a[i]]++;//记录此数字出现的个数
        if(flag[a[i]]>1)
            ans++;
    }
    memset(visit,0,sizeof(visit));
    for(int i=1; i<=n; i++)
        if(flag[i])
            visit[i]=1;//记录ｊ是否出现
    int j=1;
    for(int i=1; i<=n; i++)
        if(flag[a[i]]>1)
        {
            while(visit[j])//找到第一个没有出现的数
                j++;
            if(flag[a[i]]>N||j<a[i])//如果此数已经确定位置，或最小的没有出现的数字比此数小
            {
                flag[a[i]]--;
                a[i]=j++;
            }
            else//如果此数安排在此处合理，以后再遇到此数都要更新
                flag[a[i]]=inf;
        }
    printf("%d\n",ans);
    for(int i=1; i<=n; i++)
        printf("%d ",a[i]);
    return 0;
}