Pagini recente » Algoritmiada 2012 - Clasament Runda 1, Clasele 5-9 | Borderou de evaluare (job #1030887) | Cod sursa (job #756520) | Cod sursa (job #110168) | Cod sursa (job #1937484)
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,i,v[1000001],fr,elm;
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
fr=1;
elm=v[1];
for(i=2; i<=n; i++)
if(v[i]==elm) fr++;
else
{
fr--;
if(fr<0)
fr=1,elm=v[i];
}
fr=0;
for(i=1; i<=n; i++)
if(v[i]==elm)
fr++;
if(fr>=n/2+1)
g<<elm<<" "<<fr;
else g<<"-1";
return 0;
}