Pagini recente » Cod sursa (job #3144107) | Cod sursa (job #2966501) | Cod sursa (job #31823) | Cod sursa (job #782222) | Cod sursa (job #1198649)
#include <stdio.h>
#include <stdlib.h>
#include<conio.h>
int v[1000000];
int z;
int comparare(const void *a,const void *b)
{
return(*(const int*)a - *(const int*)b);
}
int main()
{
FILE *f,*g;
f=fopen("elmaj.in","r");
g=fopen("elmaj.out","w");
int i=0,n,k=1,a=0,x=0,j=1;
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
qsort(v,n+1,sizeof(int),comparare);
for(i=1;i<=n;i++)
{
if(k>=n/2+1)
break;
if(v[i]==v[i+1])
{
a=1;
k++;
x=v[i];
}
else if(k<n/2+1)
{
k=1;
a=0;
}
}
if(a==1)
{
fprintf(g,"%d\t",x);
fprintf(g,"%d",k);
}
else
fprintf(g,"-1");
/*for(i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
for(i=1;i<=n;i++)
{
k=0;
for(j=i;j<=n;j++)
{
if(v[i]==v[j])
k++;
}
if(k>=n/2+1)
{
a=1;
fprintf(g,"%d\t",v[i]);
fprintf(g,"%d",k);
return 0 ;
}
}
if(a==0)
{
fprintf(g,"-1");
}
*/
fclose(f);
fclose(g);
return 0;
}