Pagini recente » Cod sursa (job #2493506) | Cod sursa (job #2676722) | Cod sursa (job #2271587) | Cod sursa (job #2713658) | Cod sursa (job #1025459)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
#define maxN 1000005
int v[maxN],n;
void find_majority()
{
int x,i,k,nr;
x=-1;
k=0;
for(i=1; i<=n ;i++)
{
if(k==0)
{
x=v[i];
k++;
}
else if(v[i]==x) k++;
else k--;
}
if(x==-1) g<<x;
else
{
nr=0;
for(i=1; i<=n ;i++)
{
if(v[i]==x) nr++;
}
if(nr>=n/2+1) g<<x<<" "<<nr;
else g<<-1;
}
}
int main()
{
f>>n;
for(int i=1; i<=n ;i++)
f>>v[i];
find_majority();
return 0;
}