p2092.cpp

大概POJ上50道比较难的题的代码

#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN = 10001;
struct point{ int s,ind; };
bool cmp(point a,point b){ return a.s > b.s || a.s == b.s && a.ind < b.ind; }
point a[MAXN];
int main(){
    int N,M,x;
    while(cin >> N >> M && (N || M)){
        int n(0);
        memset(a,0,sizeof(a));
        for(int i = 0;i < N;++i)
            for(int j = 0;j < M;++j){
                scanf("%d",&x);
                a[x].ind = x;
                n = max(n,x);
                ++a[x].s;
            }
        ++n;
        sort(a,a+n,cmp);
        cout << a[1].ind;
        for(int i = 2;i < n && a[i].s == a[i-1].s;++i)
            printf(" %d",a[i].ind);
        puts("");
    }
}