#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
int32_t main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n, k; cin >> n >> k;
vector<vector<int>> r(n + 1, vector<int>(k + 1));
vector<vector<int>> u(n + 1, vector<int>(k + 1));
for (int i = 1; i <= n; i++)
for (int j = 1; j <= k; j++)
cin >> r[i][j];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= k; j++)
cin >> u[i][j];
set<int> sel;
vector<int> v(k + 1);
while(sel.size() != n) {
int cnt = 0;
for (int i = 1; i <= n; i++) {
if(sel.find(i) != sel.end()) continue;
bool ok = true;
for (int j = 1; j <= k; j++)
if(v[j] < r[i][j]) ok = false;
if(!ok) continue;
for (int j = 1; j <= k; j++) v[j] += u[i][j];
cnt++;
sel.insert(i);
}
if(!cnt) break;
}
cout << sel.size() << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |