제출 #1218236

#제출 시각아이디문제언어결과실행 시간메모리
1218236cpismayilmmdv985Topical (NOI23_topical)C++20
12 / 100
96 ms12028 KiB
#include <bits/stdc++.h>

int main() {
    using namespace std;
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    
    int N, K;   cin >> N >> K;
    vector<vector<int>> R(N, vector<int> (K)), U(N, vector<int> (K));
    for (int i = 0; i < N; i++) for (int j = 0; j < K; j++) cin >> R[i][j];
    for (int i = 0; i < N; i++) for (int j = 0; j < K; j++) cin >> U[i][j];
    vector<int> P(K);
    vector<bool> used(N);
    int cnt = 0;
    while (true) {
        bool flag = false;
        for (int i = 0; i < N; i++) {
            if (used[i])    continue;
            bool valid = true;
            for (int j = 0; j < K; j++)
                if (P[j] < R[i][j]) {
                    valid = false;
                    break;
                }
            if (valid) {
                used[i] = flag = true;
                for (int j = 0; j < K; j++) P[j] += U[i][j];
            }
        }
        if (!flag)  break;
    }
    for (int i = 0; i < N; i++) cnt += used[i];
    cout << cnt;

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...