Pagini recente » Cod sursa (job #1933009) | Cod sursa (job #3340836) | Cod sursa (job #2765444) | Cod sursa (job #3125442) | Cod sursa (job #2456991)
#include <fstream>
#include <map>
std::ifstream fin("elmaj.in");
std::ofstream fout("elmaj.out");
int main() {
int n;
fin >> n;
int a[1 + n];
int answer = -1, k = 0;
for (int i = 0; i < n; i++) {
fin >> a[i];
if (k == 0) {
answer = a[i];
k = 1;
} else if (a[i] == answer) {
k++;
} else {
k--;
}
}
int f = 0;
for (int i = 0; i < n; i++)
if (a[i] == answer)
f++;
if (answer != -1)
fout << answer << " " << f << '\n';
else
fout << "-1\n";
return 0;
}