Cod sursa(job #937703)
Utilizator | Calin Farcas Toast97 | Data | 10 aprilie 2013 21:41:40 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int v[1000005];
int main()
{
int n,i,k=1,kk=0;
f>>n;
for(i=1;i<=n;i++) f>>v[i];
sort(v,v+n+1);
for(i=2;i<=n;i++) if(v[i]==v[i-1]) k++;
else if(k>=n/2+1) {g<<v[i-1]<<" "<<k; kk=1; break;}
else k=1;
if(!kk) g<<-1;
f.close();
g.close();
return 0;
}