Pagini recente » Cod sursa (job #724604) | Cod sursa (job #1748911) | Cod sursa (job #7922) | Cod sursa (job #2852113) | Cod sursa (job #960321)
Cod sursa(job #960321)
#include <cstdio>
#include <algorithm>
using namespace std;
FILE *f=fopen ("elmaj.in","r");
FILE *g=fopen ("elmaj.out","w");
int v[1000001];
int main(){
int n,i,nr=1;
bool ok=0;
fscanf (f,"%d",&n);
for (i=1;i<=n;++i){
fscanf (f,"%d",&v[i]);
}
sort (v+1,v+n+1);
for (i=1;i<=n;++i){
if (v[i]==v[i+1]){
nr++;
}
else{
if (nr>=n/2+1){
fprintf (g,"%d %d",v[i],nr);
ok=1;
break;
}
nr=1;
}
}
if (!ok){
fprintf (g,"-1");
}
return 0;
}