Cod sursa(job #1112482)
Utilizator | Mezei Silviu Silviuss | Data | 19 februarie 2014 19:47:47 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main()
{
int n,i,v[100000],s=1;
fin>>n;
for(i=0;i<n;++i)
fin>>v[i];
sort(v,v+n);
for(i=1;i<n;++i)
if(v[i]==v[i-1])
s++;
else
{
if(s>=n/2+1)
break;
s=1;
}
fout<<v[i-1]<<" "<<s;
}