# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
475372 | Ahmed57 | Izbori (COCI17_izbori) | C++14 | 1 ms | 204 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m,k;
cin>>n>>m>>k;
int arr[n][m];
for(int i = 0;i<n;i++)for(int j = 0;j<m;j++)cin>>arr[i][j];
for(int i=0;i<m;i++){
map<int,int>mp;
for(int j = 0;j<n;j++){
mp[arr[j][i]]++;
}
if(i==0){
long long ans = 0;
int ma=0;
for(auto j:mp){
ma = max(ma,j.second);
}
for(auto j:mp){
if(j.second==ma){
ans=j.first;
break;
}
}
cout<<ans<<endl;
}
}
cout<<1<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |