Pagini recente » Cod sursa (job #2928590) | Cod sursa (job #2360277) | Cod sursa (job #2043086) | Cod sursa (job #1779159) | Cod sursa (job #668555)
Cod sursa(job #668555)
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
const int MAXN = 1000002;
int a[MAXN],i,n,c,k;
int main() {
in>>n;
c=-1;
for(i=1; i<=n; i++) {
in>>a[i];
if(!k) {
k=1;
c = a[i];
} else if(c == a[i]) {
k++;
} else {
k--;
}
}
if(c == -1) {
out<<c;
return 0;
}
int nr=0;
for(i=1; i<=n; i++)
if(a[i] == c)
nr++;
if(nr < n/2+1) {
out<<-1;
} else {
out<<c<<' '<<nr;
}
return 0;
}