제출 #1087344

#제출 시각아이디문제언어결과실행 시간메모리
1087344vjudge1Izbori (COCI17_izbori)C++17
40 / 80
1 ms604 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long



signed main() {
    int n, m, k;
    cin >> n >> m >> k;
    int a[n][m];
    for(int i = 0;i < n; i++){
        for(int j = 0;j < m ;j++){
            cin >> a[i][j];
        }
    }
    int cnt[16] = {};
    pair<int, int>mx = {-1, -1};
    for(int i = 0;i < n; i++){
        cnt[a[i][0]]++;
        mx = max(mx, make_pair(cnt[a[i][0]], a[i][0]));
    }
    cout << mx.second << endl;
    int poi[n] = {}, ans = 0;
    while(true){
        for(int i = 0;i < 16; i++)cnt[i] = 0;
        mx = {-1, -1};
        for(int i = 0;i < n; i++){
        cnt[a[i][poi[i]]]++;
        mx = max(mx, make_pair(cnt[a[i][poi[i]]], a[i][poi[i]]));
        }

        if(mx.second == k)break;
        for(int i = 0;i < n; i++){
            if(poi[i]<m and mx.second==a[i][poi[i]]  )poi[i]++;
        }
        
        ans++;
        
    }
  cout << ans << endl;
    
    
    }
#Verdict Execution timeMemoryGrader output
Fetching results...