Cod sursa(job #1838354)
Utilizator | Data | 31 decembrie 2016 20:13:04 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long v[1000000], n, maxi=-1999, mat[1000000];
int i, k=0;
int main()
{
f>>n;
for(i=1;i<=n;++i)
{
f>>v[i];
mat[v[i]]++;
}
for(i=1;i<=n;i++)
if(mat[i]>maxi) maxi=i;
for(i=1;i<=n;i++)
if(v[i]==maxi) k++;
if(k>=n/2+1)
g<<maxi<<" "<<k;
else g<<-1;
return 0;
}