Pagini recente » Cod sursa (job #417627) | Cod sursa (job #934434) | Cod sursa (job #2344680) | Cod sursa (job #3170871) | Cod sursa (job #3265591)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int NMAX = 1001;
long long v[NMAX];
int main()
{
int n, i;
int cntr = 0, candidat = 0, aparitii = 0;
fin>> n;
for(i = 1; i <= n; i++)
fin>> v[i];
for(i = 1; i <= n; i++)
{
if(cntr == 0)
{
candidat = v[i];
cntr = 1;
}
else
{
if(v[i] == candidat)
cntr++;
else
cntr--;
}
}
for(i = 1; i <= n; i++)
if(v[i] == candidat) aparitii++;
if(aparitii > n/2)
fout<< candidat<<" "<< aparitii;
else
fout<<"-1";
fin.close();
fout.close();
return 0;
}