## Maximum Product Codeforces Problems solution

Problems statement-

You are given an array of integers ${a}_{1},{a}_{2},\dots ,{a}_{n}$. Find the maximum possible value of ${a}_{i}{a}_{j}{a}_{k}{a}_{l}{a}_{t}$ among all five indices $\left(i,j,k,l,t\right)$ ($i).

Input

The input consists of multiple test cases. The first line contains an integer $t$ ($1\le t\le 2\cdot {10}^{4}$) — the number of test cases. The description of the test cases follows.

The first line of each test case contains a single integer $n$ ($5\le n\le {10}^{5}$) — the size of the array.

The second line of each test case contains $n$ integers ${a}_{1},{a}_{2},\dots ,{a}_{n}$ ($-3×{10}^{3}\le {a}_{i}\le 3×{10}^{3}$) — given array.

It's guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot {10}^{5}$.

Output

For each test case, print one integer — the answer to the problem.

Example
input
Copy
4
5
-1 -2 -3 -4 -5
6
-1 -2 -3 1 2 -1
6
-1 0 0 0 -1 -1
6
-9 -7 -5 -3 -2 1
output
Copy
-120
12
0
945
Note

In the first test case, choosing ${a}_{1},{a}_{2},{a}_{3},{a}_{4},{a}_{5}$ is a best choice: $\left(-1\right)\cdot \left(-2\right)\cdot \left(-3\right)\cdot \left(-4\right)\cdot \left(-5\right)=-120$.

In the second test case, choosing ${a}_{1},{a}_{2},{a}_{3},{a}_{5},{a}_{6}$ is a best choice: $\left(-1\right)\cdot \left(-2\right)\cdot \left(-3\right)\cdot 2\cdot \left(-1\right)=12$.

In the third test case, choosing ${a}_{1},{a}_{2},{a}_{3},{a}_{4},{a}_{5}$ is a best choice: $\left(-1\right)\cdot 0\cdot 0\cdot 0\cdot \left(-1\right)=0$.

In the fourth test case, choosing ${a}_{1},{a}_{2},{a}_{3},{a}_{4},{a}_{6}$ is a best choice: $\left(-9\right)\cdot \left(-7\right)\cdot \left(-5\right)\cdot \left(-3\right)\cdot 1=945$.

Solution -
There are 3 possible cases to maximise ans
1- all are positive(choose max possible number)
2- 4 negative 1 positive (4 minimum of all and 1 greatest positive number)
3 -2 negative and 3 positive ( Chooose 2 minimum negative and 3 highest positive number)

CODE -

### codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

### Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi

### Movie Festival CSES problem set solution

Movie Festival CSES problem set solution - Problem statement-  Time limit:  1.00 s   Memory limit:  512 MB In a movie festival  n n  movies will be shown. You know the starting and ending time of each movie. What is the maximum number of movies you can watch entirely? Input The first input line has an integer  n n : the number of movies. After this, there are  n n  lines that describe the movies. Each line has two integers  a a  and  b b : the starting and ending times of a movie. Output Print one integer: the maximum number of movies. Constraints 1 ≤ n ≤ 2 ⋅ 10 5 1 ≤ n ≤ 2 ⋅ 10 5 1 ≤ a < b ≤ 10 9 1 ≤ a < b ≤ 10 9 Example Input: 3 3 5 4 9 5 8 Output: 2 Solution - Step -1 take input in a vector as a pair first element is ending time ans second element is starting time Step -2 sort the vector in increasing order because we will watch that movie which is ending first. Step -3 iterate over vector and calculate ans .           follow code below-