Submission #510280

---

Source Code Expand

#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
#include <climits>
using namespace std;

typedef long long ll;
const double EPS = 1e-9;
const int INF = INT_MAX / 4;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<vector<int> > mat;

#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
#define pb push_back
#define mp make_pair

int main () {
    ll N, T;
    ll sumA = 0;
    cin >> N >> T;
    vector<ll> A(N), B(N), C(N);
    rep(i, N) {
        cin >> A[i] >> B[i];
        sumA += A[i];
        C[i] = A[i] - B[i];
    }

    if (sumA <= T) {
        cout << 0 << endl;
        return 0;
    }

    sort(C.begin(), C.end(), greater<ll>());

    int ans = 0;
    for (int i = 0; i < N; i++) {
        sumA -= C[i];
        ans++;
        if (sumA <= T) break;
    }

    if (sumA > T) {
        ans = -1;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result