Pagini recente » Cod sursa (job #1465772) | Istoria paginii runda/prolotomiada1 | Cod sursa (job #496493) | Cod sursa (job #1108517) | Cod sursa (job #1127575)
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,i,j,c,k,ok,v[1000003];
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
ok=0;
for(i=1;i<=n/2+1;i++)
{
c=v[i];k=1;
for(j=i+1;j<=n;j++)
{
if(c==v[j]) {k++;}
}
if(c>n/2)
{
ok=1;
break;
}
}
if(ok==1) {fout<<v[i]<<" "<<k;}
else{fout<<"-1";}
fin.close();
fout.close();
return 0;
}