Cod sursa(job #1184489)
| Utilizator | Data | 12 mai 2014 20:50:53 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int main()
{ifstream g("elmaj.in");
ofstream f("elmaj.out");
int n,x=0,v[10000000],h=0,y[10000000],k=0;
g>>n;
for(int i=1;i<=n;i++)
y[i]=0;
for(int i=1;i<=n;i++)
{g>>v[i];
if(v[i]>k)
k=v[i];
h=v[i];
y[h]=y[h]+1;
}
h=0;
for(int i=1;i<=k;i++)
{if(y[i]>=n/2+1)
{h=y[i];
x=i;
}
}
if(h==0&&h<n/2+1)
f<<"-1";
else
if(h>=n/2+1)
{f<<x;
f<<" ";
f<<h;}
return 0;
}
