Submission #1446754

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#define oo 987654321
#define INT long long
using namespace std;

int a[330][330], chk[330], ans = oo, n, m;

int main()
{
    ios::sync_with_stdio(false);
    cin>>n>>m;
    for(int i = 0 ; i < n ; i++ )
        for(int j = 0 ; j < m ; j++ )
            cin>>a[i][j];
    for(int k = 0 ; k < m ; k++ )
    {
        int cur[330] = {}, p = 0, mx = 0;
        for(int i = 0 ; i < n ; i++ )
        {
            while( p < m and chk[a[i][p]] ) p++;
            if( p < m ) cur[a[i][p]]++;
        }
        for(int i = 1 ; i <= m ; i++ )
            if( cur[mx] < cur[i] ) mx = i;

        ans = min(ans, cur[mx]);
        chk[mx] = 1;

    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result