Pagini recente » Cod sursa (job #956752) | Cod sursa (job #2192091) | Cod sursa (job #2944063) | Cod sursa (job #1581254) | Cod sursa (job #2561462)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int v[1000005];
int main()
{
int n,cand=-1,k=0,nr=0;
in >> n;
for (int i = 1; i <= n; i++)
in >> v[i];
for (int i = 1; i <= n; i++)
{
if (k == 0)//daca nu e nimeni in picioare
{
cand = v[i];
k = 1;
}
else if (cand == v[i])
k++;
else
k--;
}
for (int i = 1; i <= n; i++)
{
if (cand == v[i])
nr++;
}
if (nr > n / 2)//avem element majoritar
{
out << cand << " " << nr;
}
else
out << -1;
return 0;
}