제출 #1249807

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1249807		Geforgs	Gym Badges (NOI22_gymbadges)	C++20	0 / 100	2092 ms	12104 KiB

Main

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;

void solve(){
    ll n, i, j;
    cin>>n;
    vector<pair<ll, ll>> a(n);
    vector<ll> dp(n+1, inf);
    dp[0] = 0;
    for(i=0;i<n;++i){
        cin>>a[i].second;
    }
    for(i=0;i<n;++i){
        cin>>a[i].first;
    }
    sort(a);
    for(i=0;i<n;++i){
        for(j=n-1;j>=0;--j){
            if(dp[j] <= a[i].first){
                dp[j+1] = min(dp[j+1], dp[j]+a[i].second);
            }
        }
    }
    for(i=0;i<=n;++i){
        if(dp[i] == inf){
            cout<<i-1<<endl;
            return;
        }
    }
    cout<<n<<endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    srand(time(nullptr));
    ll t=1;
//    cin>>t;
    for(;t>0;--t){
        solve();
    }
    return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 9
• Subtask 3: 0 / 27
• Subtask 4: 0 / 49