zoj 3499 Median

#include <cstdio>#include <algorithm>using namespace std;const int maxn = 500 + 10;double a[maxn];int main(){ int T, n, i; scanf("%d", &T); while(T--) { scanf("%d", &n); for(i = 0; i < n; i++) scanf("%lf", &a[i]); sort(a, a+n); if(n&1) printf("%.3lfn", a[n/2]); else printf("%.3lfn", (a[n/2-1]+a[n/2])/2); } return 0;}