Pagini recente » Istoria paginii runda/oji20-20_dau_leak_la_probleme_smr | Cod sursa (job #1395127) | Cod sursa (job #2559179) | Cod sursa (job #2818240) | Cod sursa (job #1968194)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,i,j,ok,v[100001];
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
i=1;
while(i<n){
j=i;
while(j<n&&v[i]==v[j])
j++;
if(j-i>=n/2+1){
g<<v[i]<<" "<<j-i;
ok=1;
break;}
i++;
}
if(ok==0)
g<<-1;
return 0;
}