제출 #969106

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
969106		TrendBattles	Gym Badges (NOI22_gymbadges)	C++14	0 / 100	106 ms	4348 KiB

Main

//https://oj.uz/problem/view/NOI22_gymbadges
#include <bits/stdc++.h>
using namespace std;
using lli = int64_t;

#define INFILE "NOI22_gymbadges.inp"
#define OUTFILE "NOI22_gymbadges.ans"
int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    if (fopen(INFILE, "r")) {
        freopen(INFILE, "r", stdin);
        freopen(OUTFILE, "w", stdout);
    }
    
    int N; cin >> N;
    vector <int> X(N), L(N);
    for (int& v : X) cin >> v;
    for (int& v : L) cin >> v;

    if (*max_element(L.begin(), L.end()) == *min_element(L.begin(), L.end())) {
        sort(X.begin(), X.end());

        int ans = N;
        lli sum = 0;
        for (int i = 0; i < N; ++i) {
            sum += X[i];
            if (sum > L[0]) {
                ans = i; break;
            }
        }
        cout << ans;
        return 0;
    }

    vector <int> order(N); iota(order.begin(), order.end(), 0);
    sort(order.begin(), order.end(), [&] (int u, int v) {
        return L[u] < L[v];
    });
    const lli inf = 0x3f3f3f3f3f3f3f3f;
    vector <lli> dp(N + 1, inf);

    dp[0] = 0;
    for (int i = 0; i < N; ++i) {
        for (int j = N; j; --j) {
            if (dp[j - 1] <= L[order[i]]) {
                dp[j] = min(dp[j], dp[j - 1] + X[order[i]]);
            }
        }
    }

    for (int i = N; i >= 0; --i) {
        if (dp[i] < inf) {
            cout << i; return 0;
        }
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'int main()':
Main.cpp:11:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |         freopen(INFILE, "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:12:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |         freopen(OUTFILE, "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

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