Dijkstra K state

/*
    Task        : dijkstra
    Author      : Phumipat C. [MAGCARI]
    Language    : C++
*/
#include<bits/stdc++.h>
using namespace std;
struct A{
    int v,w,k;
    bool operator < (const A&o) const{
        return w>o.w;
    }
};
priority_queue<A > heap;
vector<A > g[100010];
int dis[100010][110];
int main(){
    int n,m,u,v,w,lim;
    cin >> n >> m >> lim;
    for(int i=1;i<=m;i++){
        scanf("%d %d %d",&u,&v,&w);
        g[u].push_back({v,w});
        g[v].push_back({u,w});
    }
    for(int i=1;i<=n;i++)
        for(int j=0;j<=100;j++)
            dis[i][j] = 1e9;
    dis[1][0] = 0;
    heap.push({1,0,0});
    while(!heap.empty()){
        A now = heap.top();
        heap.pop();
        for(auto x:g[now.v]){

            if(now.k+1<=lim && dis[x.v][now.k+1] > now.w){
                dis[x.v][now.k+1] = now.w;
                heap.push({x.v,now.w,now.k+1});
            }

            if(dis[x.v][now.k] > now.w + x.w){
                dis[x.v][now.k] = now.w + x.w;
                heap.push({x.v,now.w+x.w,now.k});
            }
        }
    }
    printf("%d\n",dis[n]);
    return 0;
}