Pagini recente » Cod sursa (job #2057676) | Cod sursa (job #1501421) | Cod sursa (job #1514383) | Cod sursa (job #3211933) | Cod sursa (job #3197984)
#include <algorithm>
#include <fstream>
#include <utility>
#include <vector>
std::ifstream fin("elmaj.in");
std::ofstream fout("elmaj.out");
int main () {
int n; fin >> n;
std::vector<int> v(n);
for (int i = 0; i < n; i += 1)
fin >> v[i];
int contor = 1, candidat = v[0];
for (int i = 1; i < n; i += 1) {
if (v[i] != candidat) {
contor -= 1;
if (contor == 0)
contor = 1, candidat = v[i];
} else
contor += 1;
}
contor = 0;
for (int i = 0; i < n; i += 1)
if (v[i] == candidat)
contor += 1;
if (contor >= n / 2 + 1)
fout << candidat << ' ' << contor;
else
fout << -1;
return 0;
}