Pagini recente » Cod sursa (job #152538) | Cod sursa (job #1458871) | Cod sursa (job #1887260) | Cod sursa (job #2242095) | Cod sursa (job #1551842)
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,mx,mx1,mi,k,i,v[1000010],c[200000010];
int main()
{
f >> n ;
mi = 999999999 ;
mx = -9 ;
for ( i = 1 ; i <= n ; ++ i )
{
f >> v[i] ;
++ c[v[i]] ;
if ( v[i] < mi )
mi = v[i] ;
if ( v[i] > mx )
mx = v[i] ;
}
mx1 = -9 ;
for ( i = mi ; i <= mx ; ++ i )
{
if ( c[i] > mx1 && c[i] >= n / 2 + 1 )
{
mx1 = c[i] ;
k = i ;
}
}
if ( mx1 > -9 )
g << k << " " << mx1 << '\n' ;
else
g << -1 << '\n' ;
return 0 ;
}