# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1171099 | KhoaDuy | Topical (NOI23_topical) | C++17 | 212 ms | 74720 KiB |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k;
cin >> n >> k;
int r[n][k],u[n][k];
long long sum[k]={0};
vector<vector<pair<int,int>>> order(k);
for(int i=0;i<n;i++){
for(int j=0;j<k;j++){
cin >> r[i][j];
order[j].push_back({r[i][j],i});
}
}
for(int i=0;i<n;i++){
for(int j=0;j<k;j++){
cin >> u[i][j];
}
}
for(int j=0;j<k;j++){
sort(order[j].begin(),order[j].end());
}
vector<int> candi;
int ptr[k],cnt[n]={0};
memset(ptr,-1,sizeof(ptr));
int ans=0;
while(true){
# | 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... |