CareerCup

Try this

/* package whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Ideone
{
                public static void main (String[] args) throws java.lang.Exception
                {
                                // your code goes here
                                int[] integerArray = {1,2,3,4,5,5,6};
                                System.out.println(getMinStones(integerArray, 3));
                                
                }
                public static int getMinStones(final int a[], final int k) {

    if ((a.length < k)) {
      return -1;
    }

    Arrays.sort(a);
    int i, last, stones1, stones2,stones, count;
    stones1 = 0;
    stones2 = 0;

    // Traverse until last repeated value of a[i]
    for (i = k; i < a.length && a[k - 1] == a[i]; i++);
    last = a[i - 1];

   // Count number of stones from end of array
    for (i = 0; i < k; i++)
    {
                stones1 += a[a.length - 1 - i];
    }

   // 
    for (i = 0, count = 0; count < k; i++)
    {
                if ((a[a.length - i - 1] > last) )
                {
                    stones2 += last;
                }
                else
                {
                    stones2 += a[a.length - i - 1];
                    count++;
                }
    }
    stones = Math.min(stones1, stones2);
    return stones;
    }
}

Try this

/* package whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Ideone
{
                public static void main (String[] args) throws java.lang.Exception
                {
                                // your code goes here
                                int[] integerArray = {1,2,3,4,5,5,6};
                                System.out.println(getMinStones(integerArray, 3));
                                
                }
                public static int getMinStones(final int a[], final int k) {

    if ((a.length < k)) {
      return -1;
    }

    Arrays.sort(a);
    int i, last, stones1, stones2,stones, count;
    stones1 = 0;
    stones2 = 0;

    // Traverse until last repeated value of a[i]
    for (i = k; i < a.length && a[k - 1] == a[i]; i++);
    last = a[i - 1];

   // Count number of stones from end of array
    for (i = 0; i < k; i++)
    {
                stones1 += a[a.length - 1 - i];
    }

   // 
    for (i = 0, count = 0; count < k; i++)
    {
                if ((a[a.length - i - 1] > last) )
                {
                    stones2 += last;
                }
                else
                {
                    stones2 += a[a.length - i - 1];
                    count++;
                }
    }
    stones = Math.min(stones1, stones2);
    return stones;
    }
}

The answer to the question
"Why is answer 8 in your example, what if the crow put the 8 into the pot with overflow number of 11?"
is that the crow is intelligent enough to know that if he puts 2 stones in 4 pots, he would at least overflow 2 pots.

/* package whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Ideone
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		int[] integerArray = {1,2,3,4,5,5,6};
		System.out.println(getMinStones(integerArray, 3));
		
	}
	public static int getMinStones(final int a[], final int k) {

    if ((a.length < k)) {
      return -1;
    }

    Arrays.sort(a);
    int i, last, stones1, stones2,stones, count;
    for (i = k; i < a.length && a[k - 1] == a[i]; i++);
    last = a[i - 1];
    stones1 = 0;
    stones2 = 0;
    for (i = 0; i < k; i++)
    {
    	stones1 += a[a.length - 1 - i];
    }
    for (i = 0, count = 0; count < k; i++)
    {
    	if ((a[a.length - i - 1] > last) )
    	{
    	    stones2 += last;
    	}
    	else
    	{
    	    stones2 += a[a.length - i - 1];
    	    count++;
    	}
    }
    stones = Math.min(stones1, stones2);
    return stones;
    }
 }

/* package whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Ideone
{
public static void main (String[] args) throws java.lang.Exception
{
// your code goes here
int[] integerArray = {1,2,3,4,5,5,6};
System.out.println(getMinStones(integerArray, 3));

}
public static int getMinStones(final int a[], final int k) {

if ((a.length < k)) {
return -1;
}

Arrays.sort(a);
int i, last, stones1, stones2,stones, count;
for (i = k; i < a.length && a[k - 1] == a[i]; i++);
last = a[i - 1];
stones1 = 0;
stones2 = 0;
for (i = 0; i < k; i++)
{
stones1 += a[a.length - 1 - i];
}
for (i = 0, count = 0; count < k; i++)
{
if ((a[a.length - i - 1] > last) )
{
stones2 += last;
}
else
{
stones2 += a[a.length - i - 1];
count++;
}
}
stones = Math.min(stones1, stones2);
return stones;
}
}

Algorithm fails for the below input

input: {1, 2, 2, 3, 3, 3, 3, 3, 5, 9, 9, 11}, K = 5, Actual Ans: 27. This algo ans: 32