Pagini recente » Cod sursa (job #960323) | Cod sursa (job #1590321) | Cod sursa (job #1265509) | Cod sursa (job #890170) | Cod sursa (job #859171)
Cod sursa(job #859171)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
const int Nmax=1000001;
int v[Nmax];
int n;
void citire(){
f >> n;
for(int i = 1; i <= n; ++i)
f >> v[i];
}
void rezolva(){
int elem = -1, k = 0, contor = 0;
bool t = true;
for(int i = 1; i <= n; i++)
if(!k)
elem = v[i],
k = 1;
else
if(elem == v[i])
k++;
else
k--;
if(elem < 0)
t = false,
g << -1 << endl;
if(t){
for(int i = 1; i <= n; i++)
if(v[i] == elem)
contor++;
if(contor > n / 2)
g << elem << " " << contor << endl;
else
g << -1;
}
}
int main(){
citire();
rezolva();
return 0;
}