Pagini recente » Cod sursa (job #1854557) | Cod sursa (job #2094543) | Cod sursa (job #1817761) | Cod sursa (job #2355558) | Cod sursa (job #941623)
Cod sursa(job #941623)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int MAXN = 1000010;
int v[MAXN], maax, n, aux, p, c, nr;
int main(){
int i;
fin >> n;
maax = n/2 + 1;
for(i=0; i<n; ++i)
fin >> v[i];
c = 1;
aux = v[0];
for(i=1; i<n; ++i){
if(c == 0)
aux = v[i];
if(aux != v[i])
c--;
else
c++;
}
for(i=0; i<n; ++i)
if(v[i] == aux)
p++;
if(p >= maax)
fout << aux << " " << p;
else
fout << -1;
fin.close();
fout.close();
return 0;
}