Pagini recente » Cod sursa (job #2938679) | Cod sursa (job #273428) | Cod sursa (job #761470) | Cod sursa (job #2540176) | Cod sursa (job #1122150)
#include <fstream>
#include <algorithm>
using namespace std;
int n, k, i,a,nr,nrbun,v[1000001];
bool ok;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main ()
{
fin >> n >> v[1];
k = v[1];
++nr;
for(i = 2; i <= n; ++i)
{
fin >> v[i];
if(v[i] == k)
++nr;
else if(nr >= 1)
--nr;
else {k = v[i];
nr=1;}
}
if(nr<0)
{
fout << -1;
ok = 1;}
else for(i = 1; i <= n; ++i)
if(v[i] == k)
++nrbun;
if(nrbun >= n/2 + 1)
fout << k << " " << nrbun;
else if(!ok)fout << -1;
return 0;
}