Submission #1087352

#TimeUsernameProblemLanguageResultExecution timeMemory
1087352idk__Rasvjeta (COCI17_rasvjeta)C++17
0 / 50
12 ms8284 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] = {};
    int count=-1, num=0;
    for(int i = 0;i < n; i++){
        int& curr = a[i][0];
        cnt[curr]++;
        if(cnt[curr] > count)num = curr, count=cnt[curr];
        else if(cnt[curr] == count){
            if(curr > num){
                num =curr;
                count =cnt[curr];
            }
        }
    }
    cout << num << endl;
    int poi[n] = {}, ans = 0;
    while(true){
        for(int i = 0;i < 16; i++)cnt[i] = 0;
        count=-1, num=-1;
        for(int i = 0;i < n; i++){
        int& curr = a[i][poi[i]];

        cnt[curr]++;
        if(cnt[curr] > count)num = curr, count=cnt[curr];
        else if(cnt[curr] == count){
            if(curr > num){
                num = curr;
                count = cnt[curr];
            }
        }
        
        }

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