Humble Numbers

#include<iostream>
#include<fstream>
using namespace std;
ifstream fin ("humble.in");
ofstream fout ("humble.out");
int main()
{
	int k,n,i,j;
	int s[102],hm[100002],index[102];
	for(i=1;i<=101;i++)
		index[i]=1;
	fin>>k>>n;
	for(i=1;i<=k;i++)
		fin>>s[i];
	for(i=1;i<=k;i++)
	{
		for(j=i+1;j<=k;j++)
		{
			if(s[i]>s[j])
			{
				int temp=s[i];
				s[i]=s[j];
				s[j]=temp;
			}
		}
	}
	//for(i=1;i<=k;i++)
	//	cout<<s[i]<<' ';
	//cout<<endl;
	hm[1]=1;
	for(i=2;i<=n+1;i++)//正在找第i个
	{
		int min=1746374179;
		for(j=1;j<=k;j++)
		{
			while(hm[index[j]]*s[j]<=hm[i-1])
				index[j]++;
		/*	int q=index[j];
			int p=hm[index[j]];
			int o=s[j];
			int u=hm[i-1];*/
			if(hm[index[j]]*s[j]<min)
				min=hm[index[j]]*s[j];
		}
		hm[i]=min;
	}
	/*for(i=1;i<=n+1;i++)
		cout<<hm[i]<<' ';
	cout<<endl;*/
	fout<<hm[n+1]<<endl;
	return 0;
}