Cod sursa(job #2684802)
| Utilizator | Data | 14 decembrie 2020 21:01:17 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[1000000];
int main()
{
ifstream cin ("elmaj.in");
ofstream cout ("elmaj.out");
int n, i, a, nr, sol, solnr, l;
cin>>n;
sol=0;
for (int i=0; i<n; i++)
cin>>v[i];
sort (v, v+n);
l=1;
for (int i=0; i<n-1; i++)
{
if (v[i]==v[i+1])
l++;
else
{
if (l>n/2)
{
sol=v[i];
solnr=l;
break;
}
l=1;
}
}
cout<<sol<<" "<<solnr;
return 0;
}
