Cod sursa(job #710409)
Utilizator | hahahalera alexandru94 | Data | 9 martie 2012 16:30:34 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<iostream>
#include<fstream>
using namespace std;
long n,j,s,v[1000000],p[1000000],nr,i,k;
int main ()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f.close();
sort(v+1,v+n+1)
for(i=1;i<=n;i++)
if(v[i]==v[i+1])
nr++;
else {if(nr>=n/2+1)
j=i-1;
nr=1;}
g<<v[j];
g<<" ";
g<<nr;
g.close();
}