Pagini recente » Cod sursa (job #2147985) | Cod sursa (job #2571867) | Cod sursa (job #2103632) | Cod sursa (job #2686930) | Cod sursa (job #1585385)
#include <fstream>
#include <vector>
using namespace std;
int main()
{
ifstream in("elmaj.in");
int n;
vector <int> v;
int cit;
in >> n;
while (n--) {
in >> cit;
v.push_back(cit);
}
int maj = -1, aparitii = 0;
for (auto i : v) {
if (i == maj)
aparitii++;
else if (aparitii > 0)
aparitii--;
else {
maj = i;
aparitii = 1;
}
}
aparitii = 0;
for (auto i : v) {
if (i == maj)
aparitii++;
}
ofstream out("elmaj.out");
if (aparitii >= v.size() / 2 + 1)
out << maj << ' ' << aparitii;
else
out << -1;
in.close();
out.close();
return 0;
}