Pagini recente » Cod sursa (job #3256813) | Cod sursa (job #2584257) | Cod sursa (job #2369294) | Cod sursa (job #34104) | Cod sursa (job #957919)
Cod sursa(job #957919)
#include<iostream>
#include<fstream>
using namespace std;
fstream f("elmaj.in");
ofstream g("elmaj.out");
const int N=1000001;
int v[N],n;
int elmaj(int &poz)
{int i,j;
while (i < n)
{
int j = i;
while (j < n && v[j + 1] == v[i])
j++;
if (j-i+1 > n/2)
{poz=j-i+1;return v[i];}
i = j + 1;
}
return -1;
}
int main()
{f>>n;
int i,j,aux,poz=0;
for(i=1;i<=n;++i){
f>>v[i];
}
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
if(v[j]<v[i])
{aux=v[i];
v[i]=v[j];
v[j]=aux;}
if(elmaj(poz))
g<<elmaj(poz)<<" "<<poz;
else
g<<-1;
return 0;
}