Pagini recente » Cod sursa (job #1093653) | Cod sursa (job #242414) | Cod sursa (job #1477066) | Cod sursa (job #89891) | Cod sursa (job #2433178)
#include <iostream>
#include <fstream>
const int MAXN = 1e6 + 5;
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n,v[MAXN];
int main()
{
in>>n;
for(int i = 1; i <= n; i++)
in>>v[i];
int element_majoritar = v[1],voturi = 1;
for(int i = 1; i <= n; i++){
if(v[i] == element_majoritar)
voturi++;
else if(v[i] != element_majoritar)
voturi--;
if(voturi < 0){
element_majoritar = v[i];
voturi++;
}
}
int cnt = 0;
for(int i = 1; i <= n; i++)
if(v[i] == element_majoritar)
cnt++;
if(cnt >= n / 2 + 1)
out<<element_majoritar<<" "<<cnt;
else
out<<-1;
return 0;
}