https://codeforc.es/contest/1196/problem/F
思路:优先队列每次取最短路径,因为双向且虽然路径起点终点相同的方向更新不同所以k要乘2;
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/
//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复,故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------
/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
if (_head == _tail) {
int l = fread(buffer, 1, BufferSize, stdin);
_tail = (_head = buffer) + l;
}
return *_head++;
}
inline int read() {
int x = 0, f = 1;char c = Getchar();
for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
return x * f;
}
//----------------------------------------------------------
*/
const int maxn=1e6+9;
const int maxm=4e5+9;
const int mod=1e9+7;
ll d[maxn];
vector<pair<ll,int> >g[maxn];
int n,m,k;
struct node
{
int index,st,ed;
ll cost;
node(){}
node(int _st,int _ed,ll _cost,int _index)
{
st=_st;
cost=_cost;
index=_index;
ed=_ed;
}
bool operator < (const node &b) const
{
return cost>b.cost;
}
};
set<pair<int,int> >vis;
void dj()
{
priority_queue<node>q;
for(int i=1;i<=n;i++)
{
q.push(node(i,i,g[i][0].first,0));
vis.insert({i,i});
}
k*=2;//双向
while(!q.empty())
{
node tmp=q.top();
q.pop();
int nex=g[tmp.ed][tmp.index].second;
if(!vis.count({tmp.st,nex}))
{
vis.insert({tmp.st,nex});
k--;
if(k==0)
{
cout<<tmp.cost<<endl;
return ;
}
q.push(node(tmp.st,nex,tmp.cost+g[nex][0].first,0));
}
if(tmp.index+1<g[tmp.ed].size())
{
q.push(node(tmp.st,tmp.ed,tmp.cost-g[tmp.ed][tmp.index].first+g[tmp.ed][tmp.index+1].first,tmp.index+1));
}
}
}
int main()
{
cin>>n>>m>>k;
for(int i=1;i<=m;i++)
{
int u,v,w;
cin>>u>>v>>w;
g[u].pb({w,v});
g[v].pb({w,u});
}
for(int i=1;i<=n;i++)
{
sort(g[i].begin(),g[i].end());
}
dj();
return 0;
}