CF 37 A Towers【water】

Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.

Vasya wants to construct the minimal number of towers from the bars. Help Vasya to use the bars in the best way possible.

Input
The first line contains an integer N (1 ≤ N ≤ 1000) — the number of bars at Vasya’s disposal. The second line contains N space-separated integers li — the lengths of the bars. All the lengths are natural numbers not exceeding 1000.

Output
In one line output two numbers — the height of the largest tower and their total number. Remember that Vasya should use all the bars.

Example
Input
3
1 2 3
Output
1 3
Input
4
6 5 6 7
Output
2 3

题意：找到最高的一座塔的层数，总共剩下多少座塔。

高度相同的塔是可以累加的。

#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
using namespace std;
int cnt[2000];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        int x;scanf("%d",&x);
        cnt[x]++;
    }
    int Max=0;
    int num=0;
    for(int i=0;i<=1000;i++){
        if(Max<cnt[i]){
            Max=cnt[i];
        }
        if(cnt[i]>0){
            num++;
        }
    }
    printf("%d %d\n",Max,num);
    return 0;
}