uva10057

#include <iostream>
using namespace std;
#include <stdio.h>
#include <cstring>
#include <algorithm>

const int MAXN = 1000000;
int n,num[MAXN],n1,n2;

int main() {

while(scanf("%d",&n)!=EOF) {
for(int i = 0 ; i < n ;i++)
scanf("%d",&num[i]);
int k = (n - 1)/2 ;
int n1 = 0 , n2 = 1;
sort(num,num+n);
if(n%2) { // 奇数个
for(int i = k; i >=0 && num[k] == num[i]; i--)
n1 ++;
for(int i = k +1 ; i < n && num[k] == num[i]; i++)
n1 ++ ;
}
else {
for(int i = k ; i >= 0 && num[k] == num[i]; i--) {
n1 ++;
}
for(int i  = k+1; i < n  && num[k+1] == num[i] ; i++ )
n1 ++;
n2 = num[k+1] - num[k] + 1;
}
printf("%d %d %d\n",num[k],n1,n2);
}
return 0;
}