제출 #1326748

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1326748		hieptk	Gym Badges (NOI22_gymbadges)	C++20	42 / 100	104 ms	196348 KiB

Main

#include <iostream>
#include <vector>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <cstring>
#include <unordered_map>
#include <iomanip>
#include <queue>
#include <map>
#include <sstream>
#include <stack>
#include <bitset>
#include <random>

using ll = long long;

using namespace std;

constexpr int nm = 5002;

int n;
pair<ll, ll> a[nm];
ll dp[nm][nm];

bool cmp(pair<ll, ll> &a, pair<ll, ll> &b) {
    return a.first + a.second < b.first + b.second;
}

int main() {
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i].second;
    for (int i = 1; i <= n; ++i) cin >> a[i].first;
    sort(a + 1, a + n + 1, cmp);

    memset(dp, 0x3f, sizeof(dp));
    dp[0][0] = 0;
    for (int i = 1; i <= n; ++i) {
        dp[i][0] = 0;
        for (int j = 1; j <= i; ++j) {
            dp[i][j] = dp[i - 1][j];
            if (dp[i - 1][j - 1] <= a[i].first) {
                dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + a[i].second);
            }
        }
    }

    for (int i = n; i >= 0; --i) {
        if (dp[n][i] < 1e18) {
            cout << i << "\n";
            return 0;
        }
    }
}

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