小根堆哪错了 ... QAQ

while(ans <= n) {
	t = (q.top());
	q.pop();
	cout << t << endl;
	ans ++;
	for(ri i = 1; i <= k; ++ i) {
		ll num = -t * s[i];
		if(!f.count(num)) {
			q.push(-num);
			f.insert(num);
		}
	}
}