• + 0 comments

    My solution is similar to yours but it is not able to pass the last test case... its giving wrong result for a few sets. Can you please help me understand what I did wrong.

    import java.io.*;
    import java.util.*;
    import java.text.*;
    import java.math.*;
    import java.util.regex.*;
    
    public class Main {
        public static void main(String args[] ) throws Exception {
            /* Enter your code here. Read input from STDIN. Print output to STDOUT */
            Scanner sc = new Scanner(System.in);
            int t = sc.nextInt();
            int n;
            int q1 = 0,q2 = 0,r1 = 0 ,r2 = 0;
            int sum = 0;
            int low;
            for(int ai = 0 ; ai < t ; ai ++){
                n = sc.nextInt();
                int[] a = new int[n];
                for(int i = 0 ; i < n ; i++){
                    a[i] = sc.nextInt();
                }
               sum = 0;
               int k =0;
               long sum1 = 1000000000;
               Arrays.sort(a);
               low = a[0];
               for(low = a[0] ; low >= 0 ; low--){
                 sum = 0;
               for(int i = 0 ; i < n ; i++){
                   k = a[i]-low;
                   //System.out.println(low + " " + a[i]);
                   q1 = k/5;
                   r1 = k % 5;
                   q2 = r1/2;
                   r1 = r1 % 2;
                   sum = sum + r1 + q2 + q1;
                   //System.out.println(a[i] + "---" + q1 + " " + q2 + " " + r1);
               }
               //System.out.println(sum + "");
               if(sum < sum1)
                sum1 = sum;
               }
               System.out.println(sum1); 
            }
        }
    }