uva10057 A mid-summer night's dream.

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define MAX 70000
using namespace std;

int  N,s[MAX];
int all,small,MAXX;

void solve()
{
int i=0,j,t,help;
for(j=0;j<=MAXX;j++)
{
i+=s[j];
if(i>=all-i)
break;
}
if(i>all-i)
{
t=j,help=0;
}
else
{
help=1;
for(t=j+1;t<=MAXX;t++)
{
if(s[t]!=0)
break;
}
}
printf("%d %d %d\n",j,s[j]+help,t-j+1);
}

int main()
{
int i,j;
while(scanf("%d",&N)!=EOF)
{
all=0;
MAXX=-1;
memset(s,0,MAX*4);
for(i=0;i<N;i++)
{
scanf("%d",&j);
all++;
s[j]++;
if(j>MAXX)
MAXX=j;
}
solve();
}
return 0;
}