Pagini recente » Cod sursa (job #876799) | Cod sursa (job #876783) | Cod sursa (job #879922) | Cod sursa (job #874845) | Cod sursa (job #2605855)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int v[1000001], n, p, i, nr;
int main()
{
f >> n;
for(i = 1; i <= n; ++ i)
{
f >> v[i];
if(nr == 0)
{
nr = 1;
p = v[i];
}
else if(p == v[i]) nr ++;
else nr --;
}
for(i = 1, nr = 0; i <= n; ++ i)
if(p == v[i]) nr ++;
if(nr >= n / 2 + 1)
g << p << " " << nr;
else
g << -1;
return 0;
}