9个AC，11个TLE

#include<iostream>
#include<algorithm>
using namespace std;
int a[100010];
bool b[100010];
int main()
{
    int n, temp, ans = 0;
    cin >> n;
    for(int i = 0; i < n; i++)
    {
        cin >> a[i];
        b[i] = true;
    }
    sort(a, a + n);
    for(int i = 0; i < n; i++)
    {
    	temp = i - 1;
    	while(true)
    	{
    		if(a[temp] < a[i] && b[temp] == 1)
    		{
    			break;
			}
    		if(temp == -1)
    		{
    			break;
			}
			temp--;
		}
		if(temp != -1)
		{
			ans++;
			b[temp] = 0;
		}
	}
	cout << n - ans;
    return 0;
}