1753: [Usaco2005 qua]Who's in the Middle (快速排序)

#include<algorithm>#include<cstdio>int n,a[10001];int main(){scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);std::sort(a+1,a+n+1);printf("%d",a[(n+1)/2]);return 0;}