7829. 보물왕 태혁

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWtInr3auH0DFASy&categoryId=AWtInr3auH0DFASy&categoryType=CODE

SW Expert Academy

 

설명 생략.

 

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;

int N;
vector<int> vec;

int main(int argc, char** argv)
{

	int test_case;
	int T;

	cin >> T;
	
	for (test_case = 1; test_case <= T; ++test_case)
	{
		vec.clear();
		cin >> N;

		for (int i = 0; i < N; i++)
		{
			int a;
			cin >> a;
			vec.push_back(a);
		}

		sort(vec.begin(), vec.end());

		cout << "#" << test_case << " " << vec[0] * vec[vec.size() - 1] << endl;
		

	}

	return 0;//정상종료시 반드시 0을 리턴해야합니다.
}