Codeforces Round #316 (Div. 2A) 570A Elections

题目：Click here

 #include <bits/stdc++.h>
 using namespace std;
 typedef long long ll;
 const int INF = 0x3f3f3f3f;
 const int M = +;

 int n, m;
 int a[];
 int b[];
 int main()  {
     while( ~scanf("%d%d", &n, &m ) )    {
         memset( b, , sizeof(b) );
         for( int i=; i<=m; i++ )    {
             for( int j=; j<=n; j++ )
                 scanf("%d", &a[j] );
             int maxi = n;
             for( int j=n-; j>; j-- )
                 if( a[maxi] <= a[j] )
                     maxi = j;
             b[maxi]++;
         }
         int maxc = n;
         for( int i=n-; i>; i-- )
             if( b[maxc] <= b[i] )
                 maxc = i;
         printf("%d\n", maxc );
     }
     return ;
 }