Pagini recente » Cod sursa (job #517322) | Cod sursa (job #226160) | Cod sursa (job #2423272) | Rezultatele filtrării | Cod sursa (job #2328922)
#include <fstream>
#include <queue>
#define secv pair<int,pair<int,int> >
#define s second
#define f first
using namespace std;
ifstream ff("apm.in");
ofstream g("apm.out");
vector<pair<int,int> >v[200005];
priority_queue< secv,vector<secv>,greater<secv> >h;
struct Muchie
{
int x,y;
} mu[400005];
int t[200005];
int n,m,ct,x,y,c,nr;
int main()
{
int i;
ff>>n>>m;
for(i=1; i<=m; i++)
{
ff>>x>>y>>c;
v[x].push_back({c,y});
v[y].push_back({c,x});
}
h.push({0,{1,1}});
while(!h.empty())
{
int nod=h.top().s.s;
if(t[nod]==0)
{
t[nod]=h.top().s.f;
ct+=h.top().f;
mu[++nr].x=h.top().s.f;
mu[nr].y=h.top().s.s;
h.pop();
for(i=0; i<v[nod].size(); i++)
{
if(t[v[nod][i].s]==0)
h.push({v[nod][i].f,{nod,v[nod][i].s}});
}
}
else h.pop();
}
g<<ct<<'\n';
g<<n-1<<'\n';
for(i=1; i<=nr; i++)
{
g<<mu[i].x<<" "<<mu[i].y<<'\n';
}
return 0;
}