Pagini recente » Cod sursa (job #798543) | Borderou de evaluare (job #1520421) | Cod sursa (job #701267) | Cod sursa (job #2883334) | Cod sursa (job #1993560)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int cnt, n, v[1000001], i, expected;
int main (){
in >> n;
for (int i = 1; i <= n; ++ i){
in >> v[i];
}
for (i = 1; i <= n ;++ i){
if (v[i] == expected)
cnt ++;
if (v[i] != expected)
cnt --;
if (v[i] != expected && cnt <= 0){
expected = v[i];
cnt = 1;
}
}
cnt = 0;
for (i = 1; i <= n; ++ i){
if (v[i] == expected)
cnt ++;
}
if (cnt >= n / 2 + 1)
out << expected << " " << cnt;
else
out << -1;
return 0;
}