Pagini recente » Cod sursa (job #1250597) | Cod sursa (job #779106) | Cod sursa (job #2534327) | Istoria paginii runda/tineriprogr/clasament | Cod sursa (job #2150195)
#include <fstream>
#include <vector>
using namespace std;
int main()
{
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n;
fin >> n;
vector<int> vec(n);
int num = -1;
int count = 0;
for (int i = 0; i < n; ++i) {
fin >> vec[i];
count += (vec[i] == num ? 1 : -1);
if (count < 0) {
num = vec[i];
}
}
count = 0;
for (const auto &elem : vec) {
count += (elem == num ? 1 : 0);
}
if (count < n / 2 + 1) {
fout << "-1\n";
} else {
fout << num << " " << count << "\n";
}
return 0;
}