Language: C++

#include<bits/stdc++.h>
using namespace std;
const int INF = (1<<29);
typedef pair<int,int> P;
struct edge{
  int to,c;
  edge(int to=0,int c=0):to(to),c(c){}
  bool operator<(const edge& e) const {
    return c > e.c;
  }
};
int N,M;
int D[55],E[55],F[55];
bool used[55];

void dfs( int v, vector<vector<edge>> &G, vector<int>& vs ){
  if( used[v] ) return;
  used[v] = true;
  for( edge e : G[v] ){
    if( E[v] > E[e.to] ) return;
    dfs( e.to, G, vs );
  }
  vs.push_back( v );
}

struct state {
  int v,u,st,c;
  state(){}
  state(int v,int u,int st,int c):v(v),u(u),st(st),c(c){}
};


int dijk( int sv, int su, const vector<int>& vs, vector<vector<edge>>& G ) {
  int h[11][11][(1<<10)];
  fill( h[0][0], h[vs.size()][vs.size()], INF );
  int ind[55]; memset( ind, -1, sizeof(ind) );
  for(int i=0;i<(int)vs.size();i++)
    ind[vs[i]] = i;
  
  priority_queue<state> q;  
  h[ind[sv]][ind[su]][(1<<ind[sv])|(1<<ind[su])] = 0;
  q.push( state( ind[sv], ind[su], (1<<ind[sv])|(1<<ind[su]), D[sv] + D[su] ) );  
  while( !q.empty() ) {
    state p = q.top(); q.pop();
    for( edge e : G[vs[p.v]] ) {
      if( ind[e.to] == -1 ) continue;
      int nc = p.c + e.c;
      int nst = p.st;
      if( !(nst & (1<<ind[e.to])) ){
        nst = (1<<ind[e.to]);
        nc = nc + D[e.to];
      }      
      if( h[ind[e.to]][p.u][nst] > nc ) {
        h[ind[e.to]][p.u][nst] = nc;
        q.push( state(ind[e.to],p.u,nst,nc) );
      }
    }
    if( h[p.u][p.v][p.st] > p.st ){
      
    }
  }
  
}

int H[55][11][11][11][11];
 int make_rot( const vector<int> &vs, vector<vector<edge>>& G ){
  int f = F[ vs.back() ];
  for( int v : vs ){
    for( int u : vs ){
      
    }
  }
}


int scc( vector<vector<edge>> &G, vector<vector<edge>> &rG ){
  memset( used,0,sizeof(used) );
  vector<int> vs;
  for(int i=0;i<N;i++)
    dfs( i, G, vs );
  memset( used,0,sizeof(used) );
  reverse( vs.begin(),vs.end() );
  for(int v : vs){
    if( used[v] ) continue;
    vector<int> sv;
    dfs( v, rG, sv );
    
  }
}


int main(){
  while( cin >> N>> M &&(N|M) ){
    map<int,int> es;
    D[0] = D[N-1] = 0;
    E[0] = -1;
    E[N-1] = INF;
    for(int i=1;i<N-1;i++){
      cin >> D[i] >> E[i];
      F[i] = es[ E[i] ]++;
    }    
    for(int i=0;i<M;i++){
      int a,b,c; cin >> a >> b >> c; --a; --b;
      G[a].emplace_back( b, c );
    }

    int res = INF;
    sort( es.begin(), es.end() );
    es.erase( unique(es.begin(), es.end()), es.end() );
    for(P e : es){
      res = min( res, solve( e ) );
    }
    cout << res << endl;
  }
}

Compiler output:
a.cc: In function 'int dijk(int, int, const std::vector<int>&, std::vector<std::vector<edge> >&)':
a.cc:63:1: warning: no return statement in function returning non-void [-Wreturn-type]
   63 | }
      | ^
a.cc: In function 'int make_rot(const std::vector<int>&, std::vector<std::vector<edge> >&)':
a.cc:73:1: warning: no return statement in function returning non-void [-Wreturn-type]
   73 | }
      | ^
a.cc: In function 'int scc(std::vector<std::vector<edge> >&, std::vector<std::vector<edge> >&)':
a.cc:89:1: warning: no return statement in function returning non-void [-Wreturn-type]
   89 | }
      | ^
a.cc: In function 'int main()':
a.cc:104:7: error: 'G' was not declared in this scope
  104 |       G[a].emplace_back( b, c );
      |       ^
a.cc:111:23: error: 'solve' was not declared in this scope
  111 |       res = min( res, solve( e ) );
      |                       ^~~~~
In file included from /usr/include/c++/14/algorithm:61,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algo.h: In instantiation of 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = _Rb_tree_iterator<pair<const int, int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]':
/usr/include/c++/14/bits/stl_algo.h:4772:18:   required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = _Rb_tree_iterator<pair<const int, int> >]'
 4772 |       std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
      |       ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:108:9:   required from here
  108 |     sort( es.begin(), es.end() );
      |     ~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1906:50: error: no match for 'operator-' (operand types are 'std::_Rb_tree_iterator<std::pair<const int, int> >' and 'std::_Rb_tree_iterator<std::pair<const int, int> >')
 1906 |                                 std::__lg(__last - __first) * 2,
      |                                           ~~~~~~~^~~~~~~~~
In file included from /usr/include/c++/14/bits/stl_algobase.h:67,
                 from /usr/include/c++/14/algorithm:60:
/usr/include/c++/14/bits/stl_iterator.h:618:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr decltype ((__y.base() - __x.base())) std::operator-(const reverse_iterator<_Iterator>&, const reverse_iterator<_IteratorR>&)'
  618 |     operator-(const reverse_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:618:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_algo.h:1906:50: note:   'std::_Rb_tree_iterator<std::pair<const int, int> >' is not derived from 'const std::reverse_iterator<_Iterator>'
 1906 |                                 std::__lg(__last - __first) * 2,
      |                                           ~~~~~~~^~~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:1790:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr decltype ((__x.base() - __y.base())) std::operator-(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)'
 1790 |     operator-(const move_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:1790:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_algo.h:1906:50: note:   'std::_Rb_tree_iterator<std::pair<const int, int> >' is not derived from 'const std::move_iterator<_IteratorL>'
 1906 |                                 std::__lg(__last - __first) * 2,
      |                                           ~~~~~~~^~~~~~~~~
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:166:
/usr/include/c++/14/valarray:1197:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const typename valarray<_Tp>::value_type&, const valarray<_Tp>&)'
 1197 | _DEFINE_BINARY_OPERATOR(-, __minus)
      | ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/valarray:1197:1: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_algo.h:1906:50: note:   'std::_Rb_tree_iterator<std::pair<const int, int> >' is not derived from 'const std::valarray<_Tp>'
 1906 |                                 std::__lg(__last - __first) * 2,
      |                                           ~~~~~~~^~~~~~~~~
/usr/include/c++/14/valarray:1197:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__minus, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const valarray<_Tp>&, const typename valarray<_Tp>::value_type&)'
 1197 | _DEFINE_BINARY_OPERATOR(-, __minus)
      | ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/valarray:1197:1: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_algo.h:1906:50: note:   'std::_Rb_tree_iterator<std::pair<const int, int> >' is not derived from 'const std::valarray<_Tp>'
 1906 |                                 std::__lg(__last - __first) * 2,
      |                                           ~~~~~~~^~~~~~~~~
/usr/include/c++/14/valarray:1197:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__minus, std::_ValArray, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const valarray<_Tp>&, const valarray<_Tp>&)'
 1197 | _DEFINE_BINARY_OPERATOR(-, __minus)
      | ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/valarray:1197:1: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_algo.h:1906:50: note:   'std::_Rb_tree_iterator<std::pair<const int, int> >' is not derived from 'const std::valarray<_Tp>'
 1906 |                                 std::__lg(__last - __first) * 2,
      |                                           ~~~~~~~^~~~~~~~~
In file included from /usr/include/c++/14/valarray:605:
/usr/include/c++/14/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__minus, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const valarray<typename _Dom::value_type>&, const _Expr<_Dom1, typename _Dom1::value_type>&)'
  406 |     _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/valarray_after.h:406:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_algo.h:1906:50: note:   'std::_Rb_tree_iterator<std::pair<const int, int> >' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
 1906 |                                 std::__lg(__last - __first) * 2,
      |                                           ~~~~~~~^~~~~~~~~
/usr/include/c++/14/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const _Expr<_Dom1, typename _Dom1::value_type>&, const valarray<typename _Dom::value_type>&)'
  406 |     _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/valarray_after.h:406:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_algo.h:1906:50: note:   'std::_Rb_tree_iterator<std::pair<const int, int> >' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
 1906 |                                 std::__lg(__last - __first) * 2,
      |                                           ~~~~~~~^~~~~~~~~
/usr/include/c++/14/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const typename _Dom::value_type&, const _Expr<_Dom1, typename _Dom1::value_type>&)'
  406 |     _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/valarray_after.h:406:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_algo.h:1906:50: note:   'std::_Rb_tree_iterator<std::pair<const int, int> >' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
 1906 |                                 std::__lg(__last - __first) * 2,
      |                                           ~~~~~~~^~~~~~~~~
/usr/include/c++/14/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const _Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&)'
  406 |     _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/valarray_after.h:406:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_algo.h:1906:50: note:   'std::_Rb_tree_iterator<std::pair<const int, int> >' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
 1906 |                                 std::__lg(__last - __first) * 2,
      |                                           ~~~~~~~^~~~~~~~~
/usr/include/c++/14/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom1, class _Dom2> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const _Expr<_Dom1, typename _Dom1::value_type>&, const _Expr<_Dom2, typename _Dom2::value_type>&)'
  406 |     _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits