Pagini recente » Cod sursa (job #1908264) | Cod sursa (job #763051) | Cod sursa (job #1738077) | Cod sursa (job #1357442) | Cod sursa (job #650194)
Cod sursa(job #650194)
#include <stdio.h>
int n,i,j,aux,v[10000];
int maj(int v[],int n){
int j,i=0;
while (i<n){
j=i;
while(j<n&&v[j+1]==v[i])
j++;
if(j-i+1>n/2)
return v[i];
i=j+1;
}
return -1;
}
int main(){
FILE *f,*g;
f=fopen("elmaj.in","r");
g=fopen("elmaj.out","w");
fscanf(f,"%d",&n);
for(i=0;i<=n-1;i++)
fscanf(f,"%d", &v[i]);
fclose(f);
for (i=0; i<n-1; i++)
for (j=i+1; j<n; j++){
if(v[i]>v[j]){
aux=v[i];
v[i]=v[j];
v[j]=aux;
}
}
fprintf(g,"%",maj(v,n));
fclose(g);
}