Language: C++

/*
author: madhav_1999 aka orthodoxparadox
26 April 2020 at 5:53 PM
*/

#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define dbl long double
#define int ll
#define ll long long
#define pii pair<int, int>
#define len(x) (int) x.size()
#define rev(a) reverse(all(a))
#define oiint ostream_iterator<int>(cout, " ") 
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
#define all(a) a.begin(), a.end()
#define initialise(a, x) memset(a, x, sizeof(a))
#define onlyunique(v) v.erase(unique(all(v)), v.end()); //only for sorted vector
#define inf 2e18
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#ifdef MADHAV
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){cerr << name << " : " << arg1 << endl;}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
	const char* comma = strchr(names + 1, ',');
	cerr.write(names, comma - names) << " : " << arg1 << "  ";
	__f(comma + 1, args...);}
#else
#define dbg(...) 42
#endif
template <typename X> ostream& operator << (ostream& x,const vector<X>& v){for(int i=0;i<(int)v.size();++i) x<<v[i]<<" ";return x;} 
template <typename X> ostream& operator << (ostream& x,const set<X>& v){for(auto it:v) x<<it<<" ";return x;} 
template <typename X> ostream& operator << (ostream& x,const multiset<X>& v){for(auto it:v) x<<it<<" ";return x;} 
template <typename X, typename Y> ostream& operator << (ostream& x, const pair<X,Y>& v) {x<<v.ff<<" "<<v.ss;return x;} 
template <typename T, typename S> ostream& operator << (ostream& os, const map<T, S>& v) { for (auto it : v) os << it.first << "=>" << it.second << endl; return os; }
typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
struct pair_hash {inline std::size_t operator()(const std::pair<int, int> & v) const {return v.first*31+v.second;}};
const int MOD = 1e9 + 7;

int takemod(int a, int mod = MOD){a%=mod;if(a<0)a+=mod;return a;}

int fast_exp(int base, int expo, int mod = MOD) {
	int res=1;
	while(expo>0) {
		if(expo&1) res=(res*base)%mod;
		base=(base*base)%mod;
		expo>>=1;}
	return res;}

int modinv(int a, int mod = MOD){return takemod(fast_exp(takemod(a, mod), mod-2, mod), mod);}


const int N = 52;
const int K = 5004;
int dist[N][K];
bool vis[N][K];
int c[N];
int d[N];
vector<pair<int, pii>> graph[N];


void dijkstra(int src, int coins, int n) {
	for(int i = 1; i <= n; i++) {
		for(int j = 0; j < K; j++) {
			dist[i][j] = inf;
			vis[i][j] = false;
		}
	}
	dist[src][coins] = 0;
	priority_queue<pair<int, pii>, vector<pair<int, pii> >, greater<pair<int, pii> > > pq;
	pq.push({dist[src][coins], {src, coins}});
	while(!pq.empty())
	{
		int node = pq.top().ss.ff;
		int cn = pq.top().ss.ss;
		pq.pop();
		if(vis[node][cn])
		{
			continue;
		}
		vis[node][cn] = true;
		for(auto it : graph[node])
		{
			if(it.ss.ff <= cn) {
				if(dist[it.ff][cn - it.ss.ff] > dist[node][cn] + it.ss.ss) {
					dist[it.ff][cn - it.ss.ff] = dist[node][cn] + it.ss.ss;
					pq.push({dist[it.ff][cn - it.ss.ff], {it.ff, cn - it.ss.ff}});
				}
			}
		}
		if(cn + c[node] < K) {
			if(dist[node][cn + c[node]] > dist[node][cn] + d[node]) {
				dist[node][cn + c[node]] = dist[node][cn] + d[node];
				pq.push({dist[node][cn + c[node]], {node, cn + c[node]}});
			}
		}
	}
} 


void solve()
{
	int n, m, s;
	cin >> n >> m >> s;
	s = min(s, 5000);
	for(int i = 0; i < m; i++) {
		int u, v, a, b;
		cin >> u >> v >> a >> b;
		graph[u].push_back({v, {a, b}});
		graph[v].push_back({u, {a, b}});
	}
	for(int i = 1; i <= n; i++) {
		cin >> c[i] >> d[i];
	}
	dijkstra(1, s, n);
	for(int i = 2; i <= n; i++) {
		int ans = inf;
		for(int j = 0; j < K; j++) {
			ans = min(ans, dist[i][j]);
		}
		cout << ans << endl;
	}
}

signed main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	#ifdef MADHAV
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	freopen("error.txt", "w", stderr);
	#endif
	clock_t t1, t2;
	t1 = clock();

	int tt = 1;
	// cin >> tt;
	while(tt--)
	{
		solve();
	}
	#ifdef MADHAV
	t2 = clock(); cout << "\n\ntime taken: " << (t2-t1)/(dbl)CLOCKS_PER_SEC;
	#endif
	return 0;
}

Compiler output:
a.cc: In function 'void solve()':
a.cc:120:16: error: no matching function for call to 'min(long long int&, int)'
  120 |         s = min(s, 5000);
      |             ~~~^~~~~~~~~
In file included from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:6:
/usr/include/c++/14/bits/stl_algobase.h:233:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  233 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:233:5: note:   template argument deduction/substitution failed:
a.cc:120:16: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
  120 |         s = min(s, 5000);
      |             ~~~^~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  281 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:5686:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(initializer_list<_Tp>)'
 5686 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5686:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5696:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(initializer_list<_Tp>, _Compare)'
 5696 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5696:5: note:   template argument deduction/substitution failed:
a.cc:120:16: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
  120 |         s = min(s, 5000);
      |             ~~~^~~~~~~~~