Задача: Оптимальное заполнение мешков

MaxBags.cs

using System;
					
public class Program
{
	public static int MaxBags(int[] capacity, int[] rocks, int additionalRocks) {
		for (int i = 0; i < capacity.Length; i++)
		{
			capacity[i] -= rocks[i];
		}

		Array.Sort(capacity);

		int result = 0;
		for (int i = 0; i < capacity.Length; i++)
		{
			if (capacity[i] > 0 && additionalRocks == 0)
				return result;

			if (capacity[i] == 0)
			{
				result++;    
			}
			else if (capacity[i] <= additionalRocks)
			{
				additionalRocks -= capacity[i];
				result++;
			}
		}

		return result;
	}
	
	public static void Main()
	{
		Console.WriteLine("UniLecs");
		
		// tests
		var capacity = new int[] { 2, 3, 4, 5 };
		var rocks = new int[] { 1, 2, 4, 4 };
		Console.WriteLine(MaxBags(capacity, rocks, 2).ToString()); // 3
	}
}