提出 #74011430

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
#define all(x) x.begin(), x.end()
const char nl = '\n';
const int N = 1e5 + 1;


void solve() {
    ll n, s, t; cin >> n >> s >> t;

    vector<pair<ll,ll>> requests(n);
    for(int i = 0; i < n; i++){
        ll p, c, w; cin >> p >> c >> w;
        requests[i].first = p - c;
        requests[i].second = w;
    }
    sort(all(requests));
    reverse(all(requests));

    ll ans = 0;
    ll price = 0;
    ll weight = 0;
    for(int i = 0; i < n; i++){
        if(requests[i].first <= 0) continue;
        price += requests[i].first;
        weight += requests[i].second;
        ans++;
        if(weight <= s && price >= t){
            break;
        }
        if(weight > s){
            weight -= requests[i].first;
            price -= requests[i].second;
        }
    }

    cout << ans << nl;

    



}



int main() {
    cin.tie(0);
    cout.tie(0); 
    ios_base::sync_with_stdio(0);
     
    int t = 1; 
    //cin >> t;
    while(t--) solve();

    return 0; 
}    

提出情報

ジャッジ結果