동전 0(백준)

#include <iostream>
#include <algorithm>

using namespace std;

const int MAX = 1000;
int Arr[100000];



bool cmp(int a, int b)
{
	return a > b;//오름차순 정렬
}

int main()
{
	int N,K;

	cin >> N ;
	cin >> K ;


	for (int i = 0; i < N; i++)
	{
		cin >> Arr[i];
	}
	
	int iCount = 0;
	sort(Arr, Arr+N, cmp);

	for (int i = 0; i < N; i++)
	{
		if (K <= 0)
		{
			break;
		}

		if ( (K / Arr[i]) > 0)
		{
			iCount += (K / Arr[i]);
			K = K % Arr[i];
		}
	}
	cout << iCount <<endl;

	return 0;
}