Pagini recente » Cod sursa (job #1504916) | Cod sursa (job #128101) | Cod sursa (job #2801276) | Cod sursa (job #1504919) | Cod sursa (job #2615164)
#include <iostream>
#include <fstream>
using namespace std ;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, a[1000000],aux,ok,pol,r;
int main()
{fin>>n;
int b;
b=n/2+1;
for(int i=1;i<=n;i++)
{fin>>a[i];
}
for(int i=1;i<=n-1;i++)
{for(int j=i+1;j<=n;j++)
{if(a[i]>a[j])
{aux=a[i];
a[i]=a[j];
a[j]=aux;
}
}
}
pol=1;
int i;
for(i=2;i<=n;i++)
{if(a[i]!=a[i-1])
{if(i-pol>=b)
{fout<<a[pol]<<' '<<i-pol;
r++;
break;
}
else
{ok=0;
pol=i;
}
}
}
if(r==0)
{fout<<-1;
}
fin.close();
fout.close();
return 0;
}