暑期集训3:几何基础练习题F: CodeForces

2018学校暑期集训第三天——几何基础

练习题F —— CodeForces - 1007A

Reorder the Array

You are given an array of integers. Vasya can permute (change order) its integers. He wants to do it so that as many as possible integers will become on a place where a smaller integer used to stand. Help Vasya find the maximal number of such integers.

For instance, if we are given an array [10,20,30,40][10,20,30,40], we can permute it so that it becomes [20,40,10,30][20,40,10,30]. Then on the first and the second positions the integers became larger (20>1020>10, 40>2040>20) and did not on the third and the fourth, so for this permutation, the number that Vasya wants to maximize equals 22. Read the note for the first example, there is one more demonstrative test case.

Help Vasya to permute integers in such way that the number of positions in a new array, where integers are greater than in the original one, is maximal.

Input

The first line contains a single integer nn (1≤n≤1051≤n≤105) — the length of the array.

The second line contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109) — the elements of the array.

Output

Print a single integer — the maximal number of the array's elements which after a permutation will stand on the position where a smaller element stood in the initial array.

Examples

Input

7
10 1 1 1 5 5 3

Output

Input

5
1 1 1 1 1

Output

Note

In the first sample, one of the best permutations is [1,5,5,3,10,1,1][1,5,5,3,10,1,1]. On the positions from second to fifth the elements became larger, so the answer for this permutation is 4.

In the second sample, there is no way to increase any element with a permutation, so the answer is 0.

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;int a[100005];int main(void)
{int n;cin >> n;for(int i=0;i<n;i++)scanf("%d", &a[i]);int count=0;sort(a,a+n);for(int i=0;i<n;i++)if(a[i]>a[count])count++;cout << count << endl;return 0;
}

暑期集训3:几何基础练习题F: CodeForces - 1007A 相关推荐

暑期集训3:几何基础练习题H: POJ - 2456
2018学校暑期集训第三天--几何基础练习题H -- POJ - 2456 Aggressive cows Farmer John has built a new long barn, wit ...
暑期集训3:几何基础练习题G: HDU - 1052
2018学校暑期集训第三天--几何基础练习题G -- HDU - 1052 (昨天加练题) Tian Ji -- The Horse Racing Here is a famous sto ...
暑期集训3:几何基础练习题D: HDU - 2036
2018学校暑期集训第三天--几何基础练习题D -- HDU - 2036 改革春风吹满地 " 改革春风吹满地, 不会AC没关系; 实在不行回老家, 还有一亩三分地. 谢谢 ...
暑期集训3:几何基础练习题C: POJ - 1269
2018学校暑期集训第三天--几何基础练习题B -- POJ - 1269 Intersecting Lines We all know that a pair of distinct point ...
暑期集训3:几何基础练习题B: HDU - 2001
2018学校暑期集训第三天--几何基础练习题B -- HDU - 2001 计算两点间的距离输入两点坐标(X1,Y1),(X2,Y2),计算并输出两点间的距离. Input 输入数据有多组,每组 ...
暑期集训3:几何基础练习题A: HDU - 2002
2018学校暑期集训第三天--几何基础练习题A -- HDU - 2002 计算球体积根据输入的半径值,计算球的体积. Input 输入数据有多组,每组占一行,每行包括一个实数,表示球的半径 ...
暑期集训5:并查集线段树练习题F: HDU - 1166
2018学校暑期集训第五天--并查集线段树练习题F -- HDU - 1166 敌兵布阵 C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了.A ...
暑期集训2:ACM基础算法练习题G:POJ - 1298
2018学校暑期集训第二天--ACM基础算法练习题G -- POJ - 1298 The Hardest Problem Ever Julius Caesar lived in a time o ...
暑期集训2:ACM基础算法练习题C:CF-1008A
2018学校暑期集训第二天--ACM基础算法练习题A -- CodeForces - 1008A Romaji Vitya has just started learning Berlanes ...

暑期集训3:几何基础练习题F: CodeForces - 1007A

Reorder the Array

暑期集训3:几何基础练习题F: CodeForces - 1007A 相关推荐

最新文章

热门文章

暑期集训3:几何基础 练习题F: CodeForces - 1007A ​​​​​​​

Reorder the Array

暑期集训3:几何基础 练习题F: CodeForces - 1007A ​​​​​​​相关推荐

最新文章

热门文章

暑期集训3:几何基础练习题F: CodeForces - 1007A

暑期集训3:几何基础练习题F: CodeForces - 1007A 相关推荐