Pagini recente » Cod sursa (job #688768) | Cod sursa (job #1258981) | Rezultatele filtrării | Istoria paginii runda/meister | Cod sursa (job #3286798)
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, x, i, k, cand, nr, a[1000005];
int main()
{
fin>>n;
cand=-1;
for(i=1; i<=n; i++)
{
fin>>a[i];
if(k==0)
{
cand=a[i];
k=1;
}
else
if(a[i]==cand)
k++;
else
k--;
}
if(cand<0)
{
fout<<-1;
return 0;
}
for(i=1; i<=n; i++)
if(a[i]==cand)
nr++;
if(nr>n/2)
fout<<cand<<" "<<nr;
return 0;
}