BNUZ 练习E题

qmzhna_

于 2020-03-01 18:49:17 发布

阅读量148

点赞数

本文链接：https://blog.csdn.net/qmzhna_/article/details/104597384

版权

E - Beautiful Paintings CodeForces - 651B
There are n pictures delivered for the new exhibition. The i-th painting has beauty ai. We know that a visitor becomes happy every time he passes from a painting to a more beautiful one.

We are allowed to arranged pictures in any order. What is the maximum possible number of times the visitor may become happy while passing all pictures from first to last? In other words, we are allowed to rearrange elements of a in any order. What is the maximum possible number of indices i (1 ≤ i ≤ n - 1), such that ai + 1 > ai.

Input
The first line of the input contains integer n (1 ≤ n ≤ 1000) — the number of painting.

The second line contains the sequence a1, a2, …, an (1 ≤ ai ≤ 1000), where ai means the beauty of the i-th painting.

Output
Print one integer — the maximum possible number of neighbouring pairs, such that ai + 1 > ai, after the optimal rearrangement.

Examples
Input
5
20 30 10 50 40
Output
4
Input
4
200 100 100 200
Output
2
Note
In the first sample, the optimal order is: 10, 20, 30, 40, 50.

In the second sample, the optimal order is: 100, 200, 100, 200.

思路：先从小到大排序，这时候相邻不等的数就符合条件。循环记录相邻不等的对，同时把相邻相等的数放在数组开头，重复循环直到没有相邻相等的对。

#include<stdio.h>

int main() {
	int n;
	while(~scanf("%d",&n)) {
		int i,a[1000],ans = 0,j;
		for(i = 0; i < n; i ++) {
			scanf("%d",&a[i]);
		}
		for(i = 0; i < n - 1; i ++) {
			for(j = 0; j < n - i - 1; j ++) {
				if(a[j] > a[j+1]) {
					a[j] ^= a[j+1] ^= a[j] ^= a[j+1];
				}
			}
		}
		for(i = 1,j = 0; i < n; i ++) {
			if(a[i] > a[i-1]) {
				ans++;
			} else {
				a[j++] = a[i];
			}
			if(i == n - 1 && j){
				i = 0;
				n = j;
				j = 0;
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}