Pagini recente » Cod sursa (job #467116) | Cod sursa (job #1832965) | Cod sursa (job #2691681) | Cod sursa (job #3251117) | Cod sursa (job #3284910)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, v[1000010];
inline void elemMajoritar() {
int cand = -1, k = 0;
for(int i=1; i<=n; i++) {
if(k == 0) cand = v[i], k = 1;
else if(cand == v[i]) k++;
else k--;
}
///verificare
int nr = 0;
for(int i=1; i<=n; i++) nr += (cand == v[i]);
if(nr >= n / 2 + 1) fout << cand << " " << nr;
else fout << "-1 -1";
}
signed main()
{
fin >> n;
for(int i=1; i<=n; i++) fin >> v[i];
elemMajoritar();
return 0;
}