Pagini recente » Cod sursa (job #1901124) | Cod sursa (job #2707956) | Cod sursa (job #1436321) | Cod sursa (job #3251832) | Cod sursa (job #1496007)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream gout("elmaj.out");
int n,*v;
void findmaj(int v[],int n)
{
int k=0,nr;
for(int i=0;i<n;i++)
if(k==0)
{
k=1;
nr=v[i];
}
else
if(nr==v[i]) k++;
else k--;
k=0;
for(int i=0;i<n;i++)
if(v[i]==nr)
k++;
if(k>n/2)
gout<<nr<<" "<<k;
else
gout<<-1;
}
void read()
{
fin>>n;
v = new int[n];
for(int i=0;i<n;i++)
fin>>v[i];
}
int main()
{
read();
findmaj(v,n);
return 0;
}