提出 #67721400

---

ソースコード 拡げる

#include<bits/stdc++.h>
using namespace std;
#define rep(i, s, t) for(int i = (s); i <= (t); i ++)
#define per(i, s, t) for(int i = (s); i >= (t); i --)
template<typename T, typename T2>
inline void chmin(T &x, T2 &&y) { x = min(x, y); }
template<typename T, typename T2>
inline void chmax(T &x, T2 &&y) { x = max(x, y); }
typedef long long ll;

const int N = 2e5 + 5;
ll n, a[N], b[N];
int id[N], m;

signed main()
{
    ios::sync_with_stdio(0);cin.tie(0);
    cin >> n >> m;
    rep(i, 1, m) cin >> a[i] >> b[i], b[i] = a[i] - b[i], id[i] = i;
    sort(id + 1, id + m + 1, [](int x, int y) { 
        return b[x] == b[y] ? a[x] < a[y] : b[x] < b[y];
    });
    ll ans = 0;
    rep(o, 1, m)
    {
        int i = id[o];
        if(n >= a[i])
        {
            ans += (n - a[i]) / b[i] + 1;
            n = (n - a[i]) % b[i] + a[i] - b[i];
        }
    }
    cout << ans;

    return 0;
}

提出情報

ジャッジ結果