Pagini recente » Cod sursa (job #2652828) | Cod sursa (job #1090824) | Cod sursa (job #1949072) | Cod sursa (job #1474247) | Cod sursa (job #1184453)
#include<fstream>
using namespace std;
int tab[1000000];
int main() {
int i, elem, k = 0, n;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
fin >> n;
for(i = 0; i < n; i++) {
fin >> tab[i];
if(k == 0) {
elem = tab[i];
k = 1;
} else {
if(elem == tab[i]) k++;
else k--;
}
}
if(k == 0) {
fout << -1;
} else {
k = 0;
for(i = 0; i < n; i++) {
if(tab[i] == elem) {
k++;
}
}
if(k >= n/2 + 1) fout << elem << " " << k;
else fout << -1;
}
return 0;
}