Shuffling Parities (java)

Author: manvikri22

CodeChef/Shuffling_Parties.java

@@ -0,0 +1,49 @@
+/** Chef is given an array A consisting of N positive integers. Chef shuffles the array A and creates a new array B of length N, where Bi=(Ai+i)mod2, for each i(1≤i≤N).
+
+Find the maximum possible sum of integers of the array B, if Chef shuffles the array A optimally.
+
+Input Format
+The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
+Each test case contains two lines of input.
+The first line of each test case contains an integer N.
+The second line of each test case contains N space-separated integers A1,A2,…,AN.
+Output Format
+For each test case, print a single line containing one integer - the maximum sum of integers of the array B.
+**/
+import java.util.*;
+public class Shuffling_Parties
+{
+    public static void main (String[] args)   //main function
+    {
+        Scanner in = new Scanner (System.in);
+        int t = in.nextInt();                // taking variable t for no. of test cases
+        while(t>0)
+        {
+           int N = in.nextInt();           //Number of Positive Integers
+           int even =0;                    //Counter for even numbers
+           int odd =0;                     //Counter for odd numbers
+           int sum=0;                       //Variable to store sum
+           for(int i =0; i<N; i++)         // Loop to get input from user and check whether the input is odd or even.
+           {
+               int inp =in.nextInt();
+               if(inp % 2==0)              // Input is even
+               {
+                   even++;
+               }
+               else                         //Input is odd
+               {
+                   odd++;
+               }
+               
+           }
+           int eind =N/2, oind = N/2+N%2; //Calculating no. of all the even and odd indices possible for n numbers.
+           //we have to find the maximum possible sum of integer for array B. So maximum value which we can have is 1 at a particular index to get that we should have (Ai+i) = odd.
+           int x = Math.min(oind,even);  //Calculating No.of 1s possible by even numbers  
+           int y = Math.min(eind,odd);   //Calculating No.of 1s possible by odd numbers
+           sum = x+y;      //Calculating sum
+           System.out.println(sum);      //Printing the sum
+           t--;      //decrementing the value after running a testcase.
+        }
+    }
+    
+}