Cod sursa(job #2164881)
Utilizator | Data | 13 martie 2018 10:15:12 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,ap[200000005],i,x,Max;
int main()
{
f>>n;
for(i=1;i<=n;++i)
{
f>>x;
ap[x]++;
if(x>Max)Max=x;
}
for(i=0;i<=Max;++i)
if(ap[i]>=(n/2+1))
{
g<<i<<" "<<ap[i];
return 0;
}
return -1;
}