Pagini recente » Cod sursa (job #2888373) | Cod sursa (job #503075) | Cod sursa (job #3254410) | Cod sursa (job #1427543) | Cod sursa (job #1563966)
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int n,i,j,nr=0,ok=0,k,v[101];
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
fin>>n;
for(i=1;i<=n;i++)
{
fin>>j;
v[i]=j;
}
for(i=1;i<=n;i++)
{
nr=0;
for(k=1;k<=n;k++)
{
if(v[i]==v[k])
{
nr++;
}
}
if(n/2+1>=nr)
{
fout<<v[i]<<" "<<nr;
ok=1;
break;
}
}
if(ok==0)
{
fout<<-1;
}
fin.close();
fout.close();
return 0;
}