GYM 101061 D.Max or Min .. that is the question!（水~）

Description
给出五个正整数，选俩使得其乘积最大
Input
第一行一整数T表示用例组数，每组用例输入五个整数a[i]，a[i]互不相同不超过1000的正整数
Output
输出从a序列中选两个数的最大乘积
Sample Input
2
1 2 3 4 5
50 40 30 20 10
Sample Output
20
2000
Solution
纯净水
Code

#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<cmath>#include<vector>#include<queue>#include<map>#include<set>#include<ctime>using namespace std;typedef long long ll;#define INF 0x3f3f3f3f#define maxn 1111int T,a[6];int main(){    scanf("%d",&T);    while(T--)    {        for(int i=0;i<5;i++)scanf("%d",&a[i]);        sort(a,a+5);        printf("%d\n",a[3]*a[4]);    }    return 0;}