#include void sort(float *src, int size) { int i = 0; int j = 0; int tmp = 0; float *dst; dst = src; for (i = 0; i < size - 1; i++) { for(j = i; j < size - 1; j++) { if (*(dst + i) > *(src + j+1)){ tmp = *(dst + j + 1); *(dst + j + 1) = *(dst + i); *(dst + i) = tmp; } } } src = dst; } float getMedian(float *src, int size) { if (size % 2 == 0) { return (*(src + (size - 1)/2) + *(src + (size)/2)) / 2; } return *(src + size/2); } int main(void) { unsigned int N = 0; scanf("%d", &N); float in[1000] = {}; unsigned int itr = 0; for (itr = 0;itr < N; itr++) { scanf("%f", &in[itr]); } sort(in, N); printf("%.1f\n", getMedian(in, N)); return 0; }