Pagini recente » Cod sursa (job #2796264) | Cod sursa (job #2260256) | Cod sursa (job #2918029) | Cod sursa (job #2399729) | Cod sursa (job #1125490)
#include<fstream>
#include<cstdlib>
int n,x[1000003],i,elmaj,nrap;
using namespace std;
int cmp(const void* a, const void* b)
{
int x=*(int*)a,y=*(int*)b;
return x-y;
}
int main()
{
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
fin>>n;
for(i=0;i<n;i++)
fin>>x[i];
qsort(x,n,sizeof(int),cmp);
i=0;
while(i<n/2)
{
if(x[i]==x[i+(n/2)])
{
elmaj=x[i];
nrap=n/2+1;
i=i+n/2+1;
while(x[i]==elmaj)
{
nrap++;
i++;
}
i=n+1;
}
i++;
}
fout<<elmaj<<' '<<nrap;
fout.close();
return 0;
}