Cod sursa(job #2246818)
Utilizator | Data | 27 septembrie 2018 16:33:59 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
int n,a[1000005];
int main()
{int i;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
in>>n;
for (i=1;i<=n;i++) in>>a[i];
sort (a+1,a+n+1);
int c=1,element=-1,nr=0;
for (i=2;i<=n;i++)
{
if (a[i]==a[i-1])c++;
else
c=1;
if (c>=n/2+1)
{
element=a[i];
nr=c;
}
}
out<<element<<" "<<nr<<"\n";
}