Cod sursa(job #2362149)
| Utilizator | Data | 2 martie 2019 22:33:18 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fi("elmaj.in");
ofstream fo("elmaj.out");
const int NMAX=1e6+5;
int n,cand,k,nr,a[NMAX];
int main()
{
fi>>n;
cand=-1; k=0;
for(int i=1;i<=n;i++)
fi>>a[i];
for(int i=1;i<=n;i++)
if(!k) cand=a[i],k=1;
else if(cand==a[i]) k++;
else k--;
for(int i=1;i<=n;i++)
if(cand==a[i]) nr++;
if(nr>n/2)
fo<<cand<<" "<<nr<<"\n";
else fo<<"-1\n";
fi.close();
fo.close();
return 0;
}