#include #include #include int main ( void ) { uint16_t n, i, n_half; int16_t a[1000], sort_temp; int16_t sort_min, sort_max; uint16_t sort_min_index, sort_max_index; uint16_t sorted = 0u; scanf("%d", &n); for ( i = 0u; i < n; i++ ) { scanf("%d", &a[i]); } n_half = n / 2; while ( sorted < n_half ) { sort_min = 1000; sort_max = -1000; for ( i = sorted; i < n; i++ ) { if ( sort_min > a[i] ) { sort_min = a[i]; sort_min_index = i; } if ( sort_max < a[i] ) { sort_max = a[i]; sort_max_index = i; } } sort_temp = a[sort_min_index]; a[sort_min_index] = a[sorted]; a[sorted] = sort_temp; sort_temp = a[sort_max_index]; a[sort_max_index] = a[n - 1 - sorted]; a[n - 1 - sorted] = sort_temp; sorted ++; } for ( i = 0; i < n; i++ ) { if ( i > 0 ) { fprintf(stderr, ", "); } fprintf(stderr, "%d", a[i]); } fprintf(stderr, "\n"); if ( n % 2 ) { printf("%d\n", a[n_half]); } else { printf("%.1f\n", ((float)a[n_half] + (float)a[n_half - 1]) / 2); } return 0; }