Cod sursa(job #2480955)
| Utilizator | Data | 26 octombrie 2019 11:53:50 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,v[1000005],maxi,valmax,ap;
int main()
{
int i;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
ap=1;
for(i=2;i<=n;i++)
{
while(v[i]==v[i-1])
{
ap++;
i++;
}
if(ap>maxi) {maxi=ap; valmax=v[i-1];}
ap=1;
}
if(maxi>=n/2+1) fout<<valmax<<' '<<maxi;
else fout<<-1;
return 0;
}
