Pagini recente » Cod sursa (job #275537) | Cod sursa (job #1860348) | Cod sursa (job #2166773) | Cod sursa (job #188583) | Cod sursa (job #3239767)
#include<fstream>
using namespace std;
ifstream F("elmaj.in");
ofstream G("elmaj.out");
#define Z 2048
int a[1000000], i, n, j, k, l, p = Z;
char s[Z];
inline char A() {
if (p == Z) F.read(s, Z), p = 0;
return s[p++];
}
int B() {
int n = 0;
char c;
for (c = A(); isdigit(c); n = n * 10 + c - 48, c = A());
return n;
}
int main() {
for (n = B(); i < n; a[i] = B(), !k ? k = 1, j = a[i] : j == a[i] ? ++k : --k, ++i);
for (i = 0; i < n; l += a[i++] == j);
return l > n / 2 ? G << j << ' ' << l : G << -1, 0;
}