HDU.2561 第二小整数（water）

#include<stdio.h>
int main(void)
{
    int c;
    while (scanf("%d", &c) != EOF)
    {
        while (c-- > 0)
        {
            int n, a[10], temp;
            int i, j;
            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])
                    {
                        temp = a[j];
                        a[j] = a[j + 1];
                        a[j + 1] = temp;
                    }
                }
            }
            printf("%d\n", a[1]);
        }
    }
    return 0;
}

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int c;
    int n, a[11], i;
    while (cin>>c)
    {
        while (c-- > 0)
        {
            cin >> n;
            for (i = 0; i < n; i++)
                cin >> a[i];
            sort(a, a + n);
            cout << a[1] << endl;
        }
    }
    return 0;
}