Problem:
Score : 300 points

Problem Statement

You are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).
Your objective is to remove some of the elements in a so that a will be a good sequence.

Here, an sequence b is a good sequence when the following condition holds true:

For each element x in b, the value x occurs exactly x times in b.

For example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.

Find the minimum number of elements that needs to be removed so that a will be a good sequence.

Constraints

1 \leq N \leq 10^5

a_i is an integer.

1 \leq a_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
a_1 a_2 ... a_N

Output

Print the minimum number of elements that needs to be removed so that a will be a good sequence.

Sample Input 1

4
3 3 3 3

Sample Output 1

1

We can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.

Sample Input 2

5
2 4 1 4 2

Sample Output 2

2

We can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.

Sample Input 3

6
1 2 2 3 3 3

Sample Output 3

0

Sample Input 4

1
1000000000

Sample Output 4

1

Remove one occurrence of 10^9. Then, () is a good sequence.

Sample Input 5

8
2 7 1 8 2 8 1 8

Sample Output 5

5

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>

/*
void print(long a[], long n)
{
	for (long i = 1; i <= n; i++){
		printf("[%d] ", a[i]);
	}
	puts("");
}
*/
void sort(long data[], long left, long right)
{
	long sample = data[left], lptr = left, rptr = right;
	if (lptr < rptr){
		while (lptr != rptr){
			while ((sample < data[rptr]) && (lptr != rptr)) rptr--;
			if (lptr != rptr) data[lptr++] = data[rptr];
			while ((data[lptr] < sample) && (lptr != rptr)) lptr++;
			if (lptr != rptr) data[rptr--] = data[lptr];
		}
		data[lptr] = sample;
		sort(data, left, lptr - 1);
		sort(data, rptr + 1, right);
	}
}

long search(long x, long B[], long n)
{
	
	long l, h, m;
	l = 1; h = n;
	while (l <= h)
	{
		//printf("search for %d from %d - %d \n",x, l, h);
		m = (l + h) / 2;
		//printf("m=%d:\n ", m);
		if (x == B[m]){
			//printf("found>>%d\n", m);
			return m;
		}
		if (x > B[m]) l = m + 1;
		else h = m - 1;
	}
	//printf("Cannot Find\n");
	return -1;
}

long count(long A[], long B[], long C[], long n)
{
	sort(A, 1, n);
	//print(A, n);
	long i; long idx = 1; long id;
	for (i = 1; i <= n; i++) {
		if ((id = search(A[i], B, idx)) == -1) { B[idx++] = A[i]; C[idx - 1] += 1; /*print(B, idx);*/ }
		else { C[id] += 1; }
	}
	//printf("Finished!\n");
	return idx;
}


int main(void)
{
	long N, i, cnt;
	scanf("%ld", &N);
	long a[100001], b[100001] = { 0 }, c[100001] = { 0 };
	for (i = 1; i <= N; i++){ scanf("%ld", &a[i]); }
	//printf("Start Count\n");
	long idx = count(a, b, c, N);
	/*printf("Counted\n");
	print(a, N);
	
	print(b, idx);
	
	print(c, idx);
	*/
	cnt = 0; long x;
	for (i = 1; i <idx; i++){
		if (c[i] > 0){
			if (c[i] > b[i]) { x = c[i] - b[i]; }
			if (c[i] < b[i]) { x = c[i]; }
			if (c[i] == b[i]) { x = 0; }
			cnt += x;
		}
		else continue;
	}
	printf("%d\n", cnt);
	return 0;
}