Cod sursa(job #2116412)
Utilizator | Data | 27 ianuarie 2018 16:33:59 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
const int NMAX=1e6;
int v[NMAX +5];
int main()
{
int i,n,cnt=0;
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
}
sort(v+1,v+n+1);
for(i=1;i<=n;i++)
{
if(v[i-1]!=v[i])
{
if(cnt>=n/2+1)
{
out<<v[i-1]<<" "<<cnt;
}
cnt=1;
}
else cnt++;
}
return 0;
}