Submission #73369371

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
 
using pii = pair<int,int>;
using pll = pair<long long, long long>;
using pd = pair<double, double>;
 
const long long Mod = 1e9 + 7;
const long long mod = 998244353;
const double pi = acos(-1);
const int INF = INT_MAX;
 
ll T = 1,M,K,N, i,j,l,r, m, t = 1, Ans, sum, _sum;
string S, s;



void solve(){
    cin >> N >> K >> M;

    for(i = 0;i < N;i++){
        cin >> l >> r;

        if(l * K <= r) M -= r;
    }

    if(M <= 0) cout << "Yes\n";
    else cout << "No\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    // cin >> T;

    while(T--){
        solve();
    }

    return 0;
}

Submission Info

Judge Result