UVA 10057 - A mid-summer night's dream.

 #include <iostream>
 #include <algorithm>
 #include <vector>
 using namespace std;
 
 int main(int argc, char *argv[]){
   int n;
   int num[1000001];
   while(cin>>n){
     int min_median=0;
     int max_median=0;
     int Innum=0;
     int integers=0;
     for (int i=0; i<n; ++i){
       cin >> num[i];
     }
     sort(num, num+n);
     
     if (n%2==1){
       min_median=num[n/2];
       for (int i=0; i<n; ++i)
         if (num[i]==min_median)
           Innum++;
       integers=1;
     } else {
       max_median=num[n/2];
       min_median=num[n/2-1];
       for (int i=0; i<n; ++i)
         if (num[i]==min_median || num[i]==max_median)
           Innum++;
       integers=max_median-min_median+1;
     }
     cout << min_median << " " << Innum << " " << integers << endl;
   }
   return 0;
 }