Submission #1195148

#TimeUsernameProblemLanguageResultExecution timeMemory
1195148AiperiiiTopical (NOI23_topical)C++20
40 / 100
1095 ms23728 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    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];
        }
    }
    int ans=0;
    vector <int> p(k);
    vector <int> vis(n);
    for(int t=0;t<n;t++){
        for(int i=0;i<n;i++){
            if(vis[i])continue;
            bool ok=1;
            for(int j=0;j<k;j++){
                if(p[j]<r[i][j]){
                    ok=0;
                    break;
                }
            }
            if(ok){
                for(int j=0;j<k;j++){
                    p[j]+=u[i][j];
                }
                vis[i]=1;
                ans++;
            }
        }
    }
    cout<<ans<<"\n";
}
/*
 3 3
 0 0 0
 7 9 2
 7 8 9
 7 8 2
 7 7 7
 8 10 9

 
 4 3
 5 1 0
 0 1 5
 0 0 0
 7 7 7
 0 5 6
 1 1 1
 8 2 0
 8 1 4

*/

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...