The 8th Zhejiang Provincial Collegiate Programming Contest / M - Median

返回目录

 

代码：

#include<cstdio> #include<cstring> #include<algorithm> #include<cmath> using namespace std; inline int Rint() {int x; scanf("%d", &x); return x;} inline double Rd() {double x; scanf("%lf", &x); return x;} int n; #define MAXN 502 double a[MAXN]; int main() { int t=Rint(); while(t--) { n = Rint(); for(int i=0; i<n; i++) a[i] = Rd(); sort(a, a+n); if(n%2) { double t = floor(a[n/2]*1000+0.5)/1000; printf("%.3lf/n", t); } else { double t = (a[n/2]+a[n/2-1])/2; t = floor(t*1000+0.5)/1000; printf("%.3lf/n", t); } } }

转载于:https://www.cnblogs.com/tclh123/archive/2011/04/16/2587104.html