Pagini recente » Cod sursa (job #2261497) | Cod sursa (job #1187043) | Cod sursa (job #339934) | Cod sursa (job #1519143) | Cod sursa (job #2076351)
//Enunt: http://www.infoarena.ro/problema/elmaj
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
long long ap[1000000];
int n;
bool gasit;
int main()
{
in>>n;
long long v[n];
for(int i=0;i<n;++i)
{
in>>v[i];
++ap[v[i]];
}
for(int i=0;i<n && !gasit;++i)
if(ap[v[i]]>=(n/2+1))
{
out<<v[i]<<' '<<ap[v[i]];
gasit=1;
}
if(!gasit)
out<<-1;
return 0;
}