POJ 2092

#include <iostream>
#include <algorithm>
#define MAXN  10005
using namespace std;

int _m[MAXN];
int c[MAXN];
bool op(int a,int b);

int main()
{
    //freopen("acm.acm","r",stdin);
    int m;
    int n;
    int i;
    int j;
    int tem;
    while(cin>>m>>n)
    {
        if(m == 0 && n == 0)
        {
            break;
        }
        memset(_m,0,sizeof(_m));
        for(i = 0; i < m; ++ i)
        {
            for(j = 0; j < n; ++ j)
            {
                cin>>tem;
                ++ _m[tem];
            }
        }
        copy(_m,_m+MAXN,c);
        sort(c,c+MAXN,op);
        tem = c[0];
        for(i = 0; i < MAXN; ++ i)
        {
            if(c[i] != tem)
            {
                tem = c[i];
                break;
            }
        }
    //    cout<<c[i]<<endl;
        for(i = 0; i < MAXN; ++ i)
        {
            if(_m[i] == tem)
            {
                cout<<i<<" ";
            }
        }

        cout<<endl;
    }
}

bool op(int a,int b)
{
    if(a > b)
    {
        return true;
    }
    return false;
}

关注我的公众号，当然，如果你对Java, Scala, Python等技术经验，以及编程日记，感兴趣的话。 

技术网站地址： vmfor.com