网恋被骗五毛 · 发布于 2023-10-01 · 浏览 624 回复 0

priority_queue<int, vector<int>, greater<int>>q;
int n, x, y;
cin >> n;
for (int i = 1; i <= n; i++) {
	cin >> x;
	q.push(x);
}
while (!q.empty()) {
	cout << q.top() << " ";
	q.pop();
}