func_code_string: #include <bits/stdc++.h>   using namespace std;   void optimise() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);   }   long long int mod = 998244353;   void normalize(long long int &a) { a = (a + mod) % mod; }   long long int modmul(long long int a, long long int b) {     a = a % mod;     b = b % mod;     normalize(a);     normalize(b);     return (a * b) % mod;   }   long long int modadd(long long int a, long long int b) {     a = a % mod;     b = b % mod;     normalize(a);     normalize(b);     return (a + b) % mod;   }   long long int modsub(long long int a, long long int b) {     a = a % mod;     b = b % mod;     normalize(a);     normalize(b);     return (a - b + mod) % mod;   }   long long int me(long long int x, long long int n) {     x %= mod;     if (n == 0) return 1;     long long int u = me(x, n / 2) % mod;     u = (u * u) % mod;     if (n % 2) u = (u * x) % mod;     return u;   }   long long int me1(long long int x, long long int n) {     if (n == 0) return 1;     long long int u = me1(x, n / 2);     u = u * u;     if (n % 2) u = u * x;     return u;   }   inline long long int modInv(long long int a) { return me(a, mod - 2); }   inline long long int modDiv(long long int a, long long int b) {     return modmul(a, modInv(b));   }   float power(float x, long long int y) {     float temp;     if (y == 0) return 1;     temp = power(x, y / 2);     if (y % 2 == 0)       return temp * temp;     else {       if (y > 0)         return x * temp * temp;       else         return (temp * temp) / x;     }   }   long long int __gcd(long long int a, long long int b) {     if (b == 0)       return a;     else       return __gcd(b, a % b);   }   pair<long long int, long long int> operator+(       pair<long long int, long long int> a,       pair<long long int, long long int> b) {     return {a.first + b.first, a.second + b.second};   }   pair<long long int, long long int> operator-(       pair<long long int, long long int> a,       pair<long long int, long long int> b) {     return {a.first - b.first, a.second - b.second};   }   pair<long long int, long long int> operator*(       pair<long long int, long long int> a,       pair<long long int, long long int> b) {     return {a.first * b.first, a.second * b.second};   }   template <typename T>   ostream &operator<<(ostream &os, const set<T> &v) {     for (auto it : v) os << it <<    ;     return os;   }   template <typename T>   ostream &operator<<(ostream &os, const vector<T> &v) {     for (long long int i = 0; i < v.size(); ++i) os << v[i] <<    ;     return os;   }   void solve() {     long long int n, h, reg;     cin >> n >> h >> reg;     set<pair<long long int, long long int>> s;     vector<pair<long long int, pair<long long int, long long int>>> v;     long long int x1 = 0;     for (long long int i = 0; i < n; i++) {       long long int x, y;       cin >> x >> y;       v.push_back({x, {y, i + 1}});       if (x == 100) x1 += y;     }     sort(v.begin(), v.end());     auto k1 = v.end();     k1--;     if (reg >= x1) {       cout <<  NO ;       return;     }     long long int cur = h;     long long int t = 0;     set<long long int> used;     vector<pair<long long int, long long int>> ans;     long long int k = 0;     cout <<  YES           <<   n ;     while (cur > 0) {       for (long long int i = 0; i < v.size(); i++) {         if (used.find(v[i].second.second) == used.end()) {           long long int p = v[i].first;           if (p * h >= 100 * cur) s.insert(v[i].second);         }       }       if (s.size() > 0) {         auto k1 = s.end();         k1--;         ans.push_back({t, k1->second});         k += (k1->first);         t++;         cur -= k;         cur += reg;         if (cur > h) cur = h;         used.insert(k1->second);         s.erase(k1);       } else {         t++;         cur -= k;         cur += reg;         if (cur > h) cur = h;       }     }     cout << t <<     << ans.size() <<   n ;     for (long long int i = 0; i < ans.size(); i++)       cout << ans[i].first <<     << ans[i].second <<   n ;   }   signed main() {     optimise();     long long int t;     t = 1;     cout << fixed << setprecision(3);     while (t--) {       solve();       cout <<   n ;     }     cerr <<   n           <<  Time Elasped :   << 1.0 * clock() / CLOCKS_PER_SEC <<   n ;   }   