Submission #1446770

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define ff first
#define ss second

typedef long long int ll;
typedef vector< pair<int, int> > vii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef pair<int, int> pii;

const ll INF = 1e18;
const int inf = 1e9;
const int MOD = 1e9 + 7;
const int nax = 300 + 10;

int n, arr[nax][nax], del[nax], m;
int posrem;
int ans[nax];
int solve()
{
    memset(ans, 0, sizeof(ans));

    for(int i = 1; i <= n; i++)
    {
        int j = 1;
        while(j <= m && del[arr[i][j]] == 1) j++;
        ans[arr[i][j]]++;
    }
    int maxi = 0;
    for(int i = 1; i <= m; i++)
    {
        if(del[i] == 1) continue;
        if(maxi < ans[i])
        {
            maxi = ans[i];
            posrem = i;
        }
    }
    return maxi;
}
int main()
{
    ios::sync_with_stdio(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++) cin >> arr[i][j];
    }
    int mainans = inf;
    for(int i = 1; i <= m; i++)
    {
        int cur = solve();
        mainans = min(mainans, cur);
        del[posrem] = 1;
       // cout << cur << " " << posrem << endl;
    }
    cout << mainans;
    return 0;
}

Submission Info

Judge Result