模拟版 o(n^2) 只能过70%

#include<stdio.h>

int n,y[100010],st[100010];
int max = 0;

int judge(int x)
{
    int res = 0;
    for(int i = 0;i < n;i++)
    {
        if( (y[i] >= x && st[i] ) || (y[i] < x && !st[i])) res++;
    }
    if(res > max)
    {
        max = res;
        return 1;
    }
    else if(res == max) return 2;
    return 0;
}

int main()
{
    scanf("%d",&n);
    for(int i = 0;i < n;i++) scanf("%d%d",&y[i],&st[i]);
    int res = 0;
    for(int i = 0;i < n;i++)
    {
        int flag = judge(y[i]);
        if(flag == 1) res = y[i];
        else if(flag == 2)
            if(res < y[i]) res = y[i];
    }
    printf("%d",res);
    return 0;
}