C# static int getMoneySpent(int[] keyboards, int[] drives, int b) { int max = -1; Array.Sort(keyboards); Array.Sort(drives);

 int i = 0;
 int j = drives.Length - 1;

 while (i <= keyboards.Length - 1 && j >= 0)
 {
     int sum = keyboards[i] + drives[j];

     if (sum > b)
     {
         j--;
     }
     else
     {
         i++;

         if (sum > max)
         {
             max = sum;
         }
     }
 }

 return max;

}