Pagini recente » Cod sursa (job #2509618) | Cod sursa (job #1939078) | Cod sursa (job #273062) | Cod sursa (job #1015720) | Cod sursa (job #2368025)
#include<fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int a, cnd, v[1000005], n, aparitii, i;
int main()
{
fin >> n;
for( i = 1; i <= n; i++)
fin >> v[ i ];
i = 1;
while( i <= n )
{
a = 1; cnd = v[ i++ ];
while(a>0 && i <= n)
{
if( v[ i ] == cnd ) a++;
else a--;
i++;
}
}
aparitii=0;
for( i = 1; i <= n; i++)
if( v[ i ] == cnd )
aparitii++;
if( aparitii >= n / 2 + 1 )
fout << cnd << ' ' << aparitii;
else
fout << -1;
fin.close();
fout.close();
return 0;
}