CCF 模拟A 无脑大循环

http://115.28.138.223:81/view.page?opid=1

第一题用一组STL函数查找即可

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define within(x,a,b) ((unsigned)((x)-(a))<=((b)-(a)))
using namespace std;
int a[],n;
int d[];
int readint(int *p)
{
    int ch;
    while(!within(ch=getchar(),'',''))
        if(ch == EOF) return EOF;
    int rslt = ;
    do
        rslt=rslt*+(ch-'');
    while(within(ch=getchar(),'',''));
    *p = rslt;
    return ;
}
int donser(const void *a,const void *b)
{
    return *(int *)a-*(int *)b;
}
int main()
{
    while(cin>>n)
    {
        memset(a,,sizeof(a));
        memset(d,,sizeof(d));
        for(int i=;i<n;i++)
        {
            readint(&a[i]);
        }
        qsort(a,n,sizeof(int),donser);
        int max=,num=,minum=;
        for(int i=;i<n;i++)
        {
            if(d[a[i]]==) continue;
            d[a[i]]=;
            num=upper_bound(a,a+n,a[i])-lower_bound(a,a+n,a[i]);
            if(num>max)
            {
                max=num;
                minum=a[i];
            }
            else if((num==max)&&(minum>a[i]))
            {
                minum=a[i];
            }
        }
        cout<<minum<<endl;
    }
    return ;
}