Submission #985647

#TimeUsernameProblemLanguageResultExecution timeMemory
985647AliHasanliTopical (NOI23_topical)C++17
12 / 100
387 ms12116 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n,k,ans=0; cin>>n>>k; int r[n][k],u[n][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 p[k]={0},used[n]={0}; for(int i=0;i<n;i++) for(int j=0;j<n;j++) { if(used[j])continue; bool check=1; for(int g=0;g<k;g++) if(p[g]<r[j][g]){check=0;break;} if(check) { used[j]=1; ans++; for(int g=0;g<k;g++) p[g]+=u[j][g]; } } cout<<ans; 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...