我不理解qwq

#include <bits/stdc++.h>
#define int long long
using namespace std;
priority_queue<int,vector<int>,greater<int> > q;
const int MAXN=2000000;
int p[100001],pos[100001],n,k;
int vis[100001],cnt=0,pri[1000001];
signed main(){
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>p[i];
		q.push(p[i]);
	}
	int now=0,last;
	while(!q.empty()){
		int top=q.top();
		q.pop();
		if(top==last)continue;
		cnt++;
		if(cnt==k){
			cout<<q.top()<<endl;
			return 0;
		}
//		cout<<top<<endl;
		for(int i=1;i<=n;i++){
			int t=p[i]*top;
			q.push(t);
		}
		last=top;
	}
	return 0;
}