1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <functional>


static const int MAX = 500002;


static int iNumberCnt, iHistStart, iHistEnd, iAnswer;

static int aCnt[MAX];


static void Init()
{
    for (int i = 0; i < MAX; ++i)
    {
        aCnt[i] = 0;
    }
}


static void ReadData()
{
    int k;

    std::cin >> iNumberCnt;

    for (int i = 0; i < iNumberCnt; ++i)
    {
        std::cin >> k;

        aCnt[k - 1]++;
    }
}


static void PrepareHistogram()
{
    std::sort(aCnt, aCnt + iNumberCnt, std::greater<int>());

    iHistStart = 0;

    iHistEnd = iNumberCnt - 1;

    while (aCnt[iHistEnd] == 0)
    {
        iHistEnd--;
    }
}


static inline bool HabemusLeaderum()
{
    return aCnt[iHistStart] * 2 > iNumberCnt;
}


static inline void DoBudding()
{
    int iRequired = aCnt[iHistStart] - 1;

    while (iHistStart < iHistEnd && iRequired > 0)
    {
        if (aCnt[iHistEnd] >= iRequired)
        {
            aCnt[iHistEnd] -= iRequired;

            if (aCnt[iHistEnd] == 0)
                iHistEnd--;

            iNumberCnt -= aCnt[iHistStart++];
            iNumberCnt -= iRequired;
            break;
        }

        iRequired  -= aCnt[iHistEnd];
        iNumberCnt -= aCnt[iHistEnd--];
    }
}


static void Solve()
{
    PrepareHistogram();

    iAnswer = 1;

    while (iHistStart < iHistEnd)
    {
        if (aCnt[iHistStart] == 1)
        {
            iAnswer += (iNumberCnt - 1);
            break;
        }

        if (HabemusLeaderum())
            break;

        DoBudding();

        iAnswer++;
    }

    std::cout << iAnswer;
}


static void OneCase()
{
    Init();
    ReadData();
    Solve();
}


int main()
{
    OneCase();
	
	return 0;
}