题目链接
优先队列
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int arr[maxn];
int main(){
int n,m,x;
priority_queue<int, vector<int>, greater
题目链接
优先队列
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int arr[maxn];
int main(){
int n,m,x;
priority_queue<int, vector<int>, greater