제출 #475372

#제출 시각아이디문제언어결과실행 시간메모리
475372Ahmed57Izbori (COCI17_izbori)C++14
44 / 80
1 ms204 KiB
#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 timeMemoryGrader output
Fetching results...