Maximize sum of minimum and maximum of all groups in distribution

// Java code to find the maximum median
// of a sub array having length at least K.
import java.util.*;
public class GFG
{

// Utility function to sort an array in
// descending order
static void sort(int arr[])
{
    for (int i = 0; i < arr.length; i++)
    {     
        for (int j = i + 1; j < arr.length; j++)
        {     
              if(arr[i] < arr[j])
              {    
                  int temp = arr[i];    
                  arr[i] = arr[j];    
                  arr[j] = temp;    
              }     
        }     
    }    
}

// Function to maximum possible sum of minimum
// and maximum elements of each group
static int geeksforgeeks(int a[], int b[], int n, int k)
{
    // Sorting array a in descending order
    // and array b in ascending order.
    sort(a);

    Arrays.sort(b);

    // Variable to store the required output.
    int ans = 0;

    // Loop to store sum of first k greatest
    // element of array a[] in ans.
    // since they will be gretest element
    // of each group when distributed
    // in group one by one.
    for (int i = 0; i < k; i++) {
        if (b[i] == 1) {
            ans += 2 * a[i];
        }
        else {
            ans += a[i];
        }

        --b[i];
    }
    // Variable to store index of element a .
    int ind = k;

    // Then after when each grouped is filled,
    // then add a[ind] to ans as a[ind] will be
    // lowest element of each group.
    for (int i = 0; i < k; i++) {
        if (b[i] > 0) {
            ind += b[i] - 1;
            ans += a[ind];
            ind++;
        }
    }

    return ans;
}

// Driver code
public static void main(String args[])
{
    int N = 3;

    // Size of array a[]
    int siz = 9;

    int a[] = { 17, 12, 11, 9, 8, 8, 5, 4, 3 };
    int b[] = { 2, 3, 4 };

    // Function Call
    System.out.println(geeksforgeeks(a, b, 9, N));
}
}

// This code is contributed by Samim Hossain Mondal.