Cod sursa(job #2542356)
Utilizator | Data | 9 februarie 2020 20:47:38 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long a[1000001],nr,i,j,p,n,Max,x;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
a[x]++;
if(x>Max)
Max=x;
}
for(i=1;i<=Max;i++)
if(a[x]>n/2)
{
Max=x;
p=a[x];
}
if(p)
g<<Max<<" "<<p;
else
g<<"-1";
}