Pagini recente » Cod sursa (job #1834950) | Cod sursa (job #1271163) | Cod sursa (job #418527) | Cod sursa (job #1077617) | Cod sursa (job #1168746)
#include<fstream>
#include<algorithm>
#include<map>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
map<unsigned,unsigned>has;
map<unsigned,unsigned>::iterator it;
int T,n,i,m,v[1000000],op,maj,nrap;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
if(v[i]==op)maj++;
else
{
maj--;
if(maj<0)
{
maj=1;
op=v[i];
}
}
}
if(maj<0)g<<-1;
else
{
for(i=1;i<=n;i++)
if(v[i]==op)
nrap++;
if(nrap>n/2)
g<<op<<" "<<nrap;
else g<<-1;
}
return 0;
}