Pagini recente » Cod sursa (job #1506688) | Cod sursa (job #423545) | Cod sursa (job #1228137) | Cod sursa (job #1681779) | Cod sursa (job #1979974)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("majoritar.in");
ofstream out("majoritar.out");
int v[3000005];
int main()
{
int maj,cnt=1,n,i,o=0;
in>>n;
for(i=1;i<=n;i++) in>>v[i];
for(i=1;i<=n;i++)
{
if(i==1)
maj=v[i];
else
{
if(v[i]!=maj)
{
cnt--;
if(cnt==0)
{
maj=v[i];
cnt=1;
}
}
else
cnt++;
}
}
for(i=1;i<=n;i++)
{
if(v[i]==maj)
o++;
}
if(o>=n/2+1)
out<<maj<<" "<<o;
else
out<<"-1";
return 0;
}