Pagini recente » Cod sursa (job #1356608) | Cod sursa (job #2588335) | Cod sursa (job #84067) | Cod sursa (job #1544561) | Cod sursa (job #1348608)
#include <iostream>
#include <cstdio>
#define n_max 1000005
using namespace std;
int v[n_max] , n ;
void citire()
{
scanf( "%d" , &n ) ;
for ( int i = 1 ; i <= n ; i ++ )
scanf( "%d" , &v[i] ) ;
}
void el_maj()
{
int cand = -1 , k = 0 ;
for ( int i = 1 ; i <= n ; i ++ )
if ( k == 0 )
{
cand = v[i] ;
k = 1 ;
}
else if ( cand == v[i] )
k ++ ;
else
k -- ;
int sum = 0 ;
for ( int i = 1 ; i <= n ; i ++ )
if ( v[i] == cand )
sum ++ ;
if ( sum > n / 2 )
printf( "%d %d\n" , cand , sum ) ;
else
printf( "-1\n" ) ;
}
int main()
{
freopen( "elmaj.in" , "r" , stdin ) ;
freopen( "elmaj.out" , "w" , stdout ) ;
citire() ;
el_maj() ;
return 0;
}