Pagini recente » Cod sursa (job #282279) | Istoria paginii runda/oni_2011_ziua1_clasele_xi-xii | Cod sursa (job #9675) | Istoria paginii runda/pregatire_oji/clasament | Cod sursa (job #1723573)
#include <bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, a[1000050], sol;
int main()
{
int i, aux, cnt;
f >> n;
aux = 0;
cnt = 0;
for(i = 1; i <= n; i++)
{
f >> a[i];
//cout << a[i] << " ";
if(aux != a[i]) cnt--;
else cnt++;
if(cnt < 0)
{
aux = a[i];
cnt = 1;
}
//cout << aux << "\n";
}
cnt = 0;
for(i = 1; i <= n; i++)
if(a[i] == aux) cnt++;
if(cnt > n / 2)
g << aux << " "<< cnt << "\n";
else
g << "-1\n";
f.close();g.close();
return 0;
}