[Solution] Army Training CodeChef Solution | Solution Codechef

[Solution] Army Training CodeChef Solution | Solution Codechef

Chef is a high-ranked army officer and he has been given the job to train the army.

The army consists of N$N$ soldiers where each soldier has 3$3$ parameters:

• Attack points: Ai$A_i$ where (0<Ai<1000)$(0<A_i<1000)$;
• Defense points: (1000−Ai)$(1000-A_i)$;
• Soldier type: ATTACK or DEFENSE.

For the whole army:

• Attack value of the army is defined as the sum of attack points of all ATTACK type soldiers.
• Defense value of the army is defined as the sum of defense points of all DEFENSE type soldiers.
• Rating of the army is defined as the product of Attack value and Defense value of the army.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

Assign the soldier type to each of the soldiers to maximize the rating of the army. Print the maximum rating.

NOTE: The output may exceed the range of a 32$32$-bit integer.
Remember to use 64$64$-bit data types, such as long long in C++.

Input Format

• The first line of input will contain a single integer T$T$, denoting the number of test cases.

Counting Words CodeChef Solution

MATH1 Enrolment CodeChef Solution

Group Assignment CodeChef Solution

Army Training CodeChef Solution 

Sort the String CodeChef Solution

Prime Xor CodeChef Solution

Vowel Anxiety CodeChef Solution

Array sorting CodeChef Solution

• Each test case consists of multiple lines of input.
  • The first line of each test case contains an integer N$N$ — the number of soldiers in the army.
  • The next line contains the array A$A$ — where Ai$A_i$ denotes the attack points of the ith$i^{th}$ soldier.

Output Format

For each test case, output on a new line the maximum possible rating that can be achieved.

Constraints

• 1≤T≤100$1\le T\le 100$
• 2≤N≤1000$2\le N\le 1000$
• 0<Ai<1000$0<A_i<1000$
• Sum of N$N$ over all test cases does not exceed 2000$2000$