Cod sursa(job #2371956)
| Utilizator | Data | 6 martie 2019 20:29:01 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, a[1000001], cnt, elmaj;
int main()
{
f >> n;
for (int i = 1; i <= n; i++)
f >> a[i];
elmaj=a[1];
cnt=1;
for (int i = 2; i <= n; i++)
{
if(a[i] == elmaj) cnt++;
else cnt--;
if(cnt <= 0) elmaj=a[i], cnt=1;
}
cnt=0;
for (int i = 1; i <= n; i++)
if(a[i] == elmaj) cnt++;
if(cnt >= (n+1)/2) g << elmaj << " " << cnt;
else g << "-1";
return 0;
}
