제출 #1174392

#제출 시각아이디문제언어결과실행 시간메모리
1174392ezzzayTopical (NOI23_topical)C++20
12 / 100
731 ms70952 KiB
#include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back #define int long long signed main(){ int n,m; cin>>n>>m; vector< vector<int> > r(n+3,vector<int>(m+3)) ; vector< vector<int> > u(n+3,vector<int>(m+3)) ; vector<int> cr(m+2),vis(n+3); for(int i=1;i<n+3;i++){ for(int j=1;j<m+3;j++)r[i][j]=1e14; } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>r[i][j]; } } sort(r.begin(),r.end()); for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>u[i][j]; } } int ans=0; while(1){ bool c=0; for(int i=1;i<=n;i++){ if(vis[i])continue; bool ok=1; for(int j=1;j<=m;j++){ if(cr[j]<r[i][j])ok=0; } if(ok){ for(int j=1;j<=n;j++){ cr[j]+=u[i][j]; } vis[i]=1; c=1; ans++; } } break; } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...