Cod sursa(job #3292521)
| Utilizator | Data | 8 aprilie 2025 14:06:06 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
const int NMAX=1000000;
int v[NMAX+1];
int main()
{
int n,i,nr=0,cand=-1;
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
if(nr==0)
{
cand=v[i];
nr=1;
}else if(cand==v[i]) nr++;
else nr--;
}
if(nr==0)
g<<-1;
else
{
nr=0;
for(i=1;i<=n;i++)
if(v[i]==cand) nr++;
if(nr>=n/2+1) g<<cand<<' '<<nr;
else g<<-1;
}
f.close();
g.close();
return 0;
}
