Pagini recente » Cod sursa (job #3309712) | Cod sursa (job #991402) | Cod sursa (job #2081383) | Cod sursa (job #1707667) | Cod sursa (job #3326642)
#include <fstream>
#include <vector>
using namespace std;
int main() {
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n;
fin >> n;
vector<int> v(n);
int candidate = -1;
int count = 0;
for (int i = 0; i < n; ++i) {
fin >> v[i];
if (count == 0) {
candidate = v[i];
count = 1;
} else {
if (v[i] == candidate) {
count++;
} else {
count--;
}
}
}
int total_appearances = 0;
for (int i = 0; i < n; ++i) {
if (v[i] == candidate) {
total_appearances++;
}
}
if (total_appearances >= n / 2 + 1) {
fout << candidate << " " << total_appearances;
} else {
fout << -1;
}
fin.close();
fout.close();
return 0;
}