154-king 选 太子-nyoj20140809

#include <stdio.h>
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n,i,j,t;
        int a[20];
        scanf("%d",&n);
        for(i=0;i<n;i++)
        scanf("%d",&a[i]);
        for(i=0;i<n-1;i++)
        for(j=0;j<n-1-i;j++)
        if(a[j]>a[j+1])
        {
            t=a[j+1];
            a[j+1]=a[j];
            a[j]=t;
            }
            printf("%d\n",a[n/2]);
        }
        return 0;
    }

转载于:https://www.cnblogs.com/xiaziteng/p/3900626.html