C++-hihoCode-1105/1109-[STL][堆][prime]

#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN=100010;
priority_queue<int>q;
int m,a;string s;
int main(){
    for(cin>>m;m--;){
        cin>>s;
        if(s=="A")cin>>a,q.push(a);
        else {
            cout<<q.top()<<endl;
            q.pop();
        }
    }
    return 0;
}

#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN=1e5+10;
priority_queue<pair<int,int> >q;
vector<pair<int,int> >E[MAXN];
int n,m,u,v,w,ans,vis[MAXN];
pair<int,int>e;
void update(int u){
    vis[u]=true;
    for(int i=0;i<E[u].size();i++)
        if(!vis[E[u][i].second])q.push(E[u][i]);
}
int main(){
    for(cin>>n>>m;m--;){
        cin>>u>>v>>w;
        E[u].push_back(make_pair(-w,v));
        E[v].push_back(make_pair(-w,u));
    }
    update(1);//以下为prime最小生成树（小根堆优化）算法
    for(int i=1;i<n;i++)
        while(!q.empty()){
            e=q.top(),q.pop(),v=e.second;
            if(vis[v])continue;
            ans+=-e.first,update(v);
            break;
        }
    cout<<ans<<endl;
    return 0;
}