Pagini recente » Cod sursa (job #2936342) | Cod sursa (job #2387361) | Cod sursa (job #2936563) | Cod sursa (job #2726573) | Cod sursa (job #2101052)
#include <fstream>
#define limit 1000005
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long int n, v[limit], best = -1, k = 0;
void majority()
{
long int i;
for (i = 0; i < n; i++) {
if (!k) best = v[i], k = 1;
else if (v[i] == best) k++;
else k--;
}
if (best < 0) g << best;
long int nr = 0;
for (i = 0; i < n; i++)
if (v[i] == best) nr++;
if (nr > n / 2) g << best << ' ' << nr;
else g<<-1;
}
int main()
{
long int i;
f >> n;
for (i = 0; i < n; i++) f >> v[i];
majority();
return 0;
}