Pagini recente » Cod sursa (job #1706747) | Cod sursa (job #1503368) | Profil PreafericitulTeofan | Atasamentele paginii oji_2010_10 | Cod sursa (job #1243805)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("elmaj.in");
ifstream f2 ("elmaj.in");
ofstream g ("elmaj.out");
int n;
void rezolva() {
int cand = -1, k = 0, x;
for (int i = 1; i <= n; i++) {
f >> x;
if (k == 0) cand = x, k++;
else if (x == cand) k++;
else k--;
}
f.close(); f2 >> n;
int aparitii = 0;
for (int i = 1; i <= n; i++) {
f2 >> x;
//cout << x << ' ';
if (x == cand) aparitii++;
}
if (aparitii >= (n + 1) / 2) g << cand << ' ' << aparitii;
else g << -1;
g << '\n';
}
int main() {
f >> n;
rezolva();
return 0;
}