Pagini recente » Cod sursa (job #961695) | Cod sursa (job #409800) | Cod sursa (job #1608029) | Cod sursa (job #1260003) | Cod sursa (job #1907210)
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");
int N, M;
int a[1000003];
int main ()
{
int i, j, cnt, elmaj;
fin >> N;
for (i=1; i<=N; i++)
fin >> a[i];
elmaj=a[1];
cnt=1;
for (i=2; i<=N; i++)
{
if (a[i]==elmaj) cnt++;
else cnt--;
if (cnt<0)
{ elmaj=a[i]; cnt=1; }
}
cnt=0;
for (i=1; i<=N; i++)
if (a[i] == elmaj)
cnt++;
if (cnt<N/2+1)
fout << "-1";
else
fout << elmaj << " " << cnt << "\n";
fin.close();
fout.close();
return 0;
}