Language: C++

#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include<iomanip>
#include<cassert>
#include<bitset>
#include<sstream>
using namespace std;
#define rep(i,a,n) for(int i=(a);i<(n);i++)
#define ll long long
#define llint long long int
#define reverse(v)  reverse(v.begin(), v.end());
#define Yes(ans) if(ans)cout<<"Yes"<<endl; else cout<<"No"<<endl;
#define YES(ans) if(ans)cout<<"YES"<<endl; else cout<<"NO"<<endl;
#define hei(a) vector<a>
#define whei(a) vector<vector<a>>
#define UF  UnionFind 
#define Pint pair<int,int>
#define Pll pair<llint,llint>
#define keta(a)  fixed << setprecision(a)
constexpr auto INF = 1000000000000000000;
constexpr auto mod = 1000000007;
//辞書順はnext_permutation( begin( v ), end( v ) );やで！

struct edge { int to; llint kane, cost; };
struct usi { 
	int v, s;
	llint t;
	bool operator>(const usi& a, const usi& b) const {
		return (a.t > b.t)
	}
};

whei(edge) G;
hei(int) C, D;
int sum;
void dijkdtra(vector<vector<llint>>& d, llint s) {
	priority_queue<usi, vector<usi>> que;
	d[0][s] = 0;//スタートの距離はもちろんzero
	que.push(usi{ 0, (int)s, 0 });
	auto push = [&](int v, int c, llint t) {
		if (c < 0)return;
		if (d[v][c] <= t)return;
		d[v][c] = t;
		que.push(usi{ v,c,t });
	};
	while (!que.empty()) {
		usi p = que.top();
		que.pop();
		int v = p.v;
		int c = p.c;
		int t = p.t;
		llint a = min(C[v] + p.c, sum);
		push(p.v, a, p.t + D[v]);
		for (edge x : G[v])push(x.to, c - x.kane, t + x.cost);
	}
}

signed  main() {
	int n, m;
	cin >> n >> m;
	int s;
	cin >> s;
	G.resize(n);
	rep(i, 0, m) {
		int v, u, a, b;
		cin >> u >> v >> a >> b;
		u--; v--;
		G[u].push_back(edge{ v,a,b });
		G[v].push_back(edge{ u,a,b });
	}
	sum = (n - 1) * 50;
	rep(i, 0, n)cin >> C[i] >> D[i];
	whei(llint) d(n, hei(llint)(sum + 1, INF));
	s = min(s, sum);
	dijkdtra(d, s);
	rep(i, 1, n) {
		llint ans = INF;
		rep(j, 0, sum + 1)ans = min(ans, d[i][j]);
		cout << ans << endl;
	}
	return 0;
}


Compiler output:
a.cc:39:14: error: 'bool usi::operator>(const usi&, const usi&) const' must have exactly one argument
   39 |         bool operator>(const usi& a, const usi& b) const {
      |              ^~~~~~~~
a.cc: In function 'void dijkdtra(std::vector<std::vector<long long int> >&, long long int)':
a.cc:61:27: error: 'struct usi' has no member named 'c'
   61 |                 int c = p.c;
      |                           ^
a.cc:63:40: error: 'struct usi' has no member named 'c'
   63 |                 llint a = min(C[v] + p.c, sum);
      |                                        ^
In file included from /usr/include/c++/14/string:49,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_function.h: In instantiation of 'constexpr bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = usi]':
/usr/include/c++/14/bits/predefined_ops.h:196:23:   required from 'bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<usi*, std::vector<usi> >; _Value = usi; _Compare = std::less<usi>]'
  196 |         { return bool(_M_comp(*__it, __val)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_heap.h:140:48:   required from 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<usi*, vector<usi> >; _Distance = long int; _Tp = usi; _Compare = __gnu_cxx::__ops::_Iter_comp_val<less<usi> >]'
  140 |       while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
      |                                          ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_heap.h:216:23:   required from 'void std::push_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<usi*, vector<usi> >; _Compare = less<usi>]'
  216 |       std::__push_heap(__first, _DistanceType((__last - __first) - 1),
      |       ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  217 |                        _DistanceType(0), _GLIBCXX_MOVE(__value), __cmp);
      |                        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_queue.h:747:16:   required from 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = usi; _Sequence = std::vector<usi>; _Compare = std::less<usi>; value_type = usi]'
  747 |         std::push_heap(c.begin(), c.end(), comp);
      |         ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:50:10:   required from here
   50 |         que.push(usi{ 0, (int)s, 0 });
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_function.h:405:20: error: no match for 'operator<' (operand types are 'const usi' and 'const usi')
  405 |       { return __x < __y; }
      |                ~~~~^~~~~
In file included from /usr/include/c++/14/string:48:
/usr/include/c++/14/bits/stl_iterator.h:448:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator<(const reverse_iterator<_Iterator>&, const reverse_iterator<_Iterator>&)'
  448 |     operator<(const reverse_iterator<_Iterator>& __x,
      |     ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:448:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_function.h:405:20: note:   'const usi' is not derived from 'const std::reverse_iterator<_Iterator>'
  405 |       { return __x < __y; }
      |                ~~~~^~~~~
/usr/include/c++/14/bits/stl_iterator.h:493:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator<(const reverse_iterator<_Iterator>&, const reverse_iterator<_IteratorR>&)'
  493 |     operator<(const reverse_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:493:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_function.h:405:20: note:   'const usi' is not derived from 'const std::reverse_iterator<_Iterator>'
  405 |       { return __x < __y; }
      |                ~~~~^~~~~
/usr/include/c++/14/bits/stl_iterator.h:1694:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator<(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)'
 1694 |     operator<(const move_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:1694:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_function.h:405:20: note:   'const usi' is not derived from 'const std::move_iterator<_IteratorL>'
  405 |       { return __x < __y; }
      |                ~~~~^~~~~
/usr/include/c++/14/bits/stl_iterator.h:1760:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator<(const move_iterator<_IteratorL>&, const move_iterator<_IteratorL>&)'
 1760 |     operator<(const move_iterator<_Iterator>& __x,
      |     ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:1760:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_function.h:405:20: note:   'const usi' is not derived from 'const std::move_iterator<_IteratorL>'
  405 |       { return __x < __y; }
      |                ~~~~^~~~~