Cod sursa(job #1784690)
| Utilizator | Data | 20 octombrie 2016 13:12:23 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int k=1,n,v[500001],ok=0;
f>>n;
for(int i=1; i<=n; i++)
{
f>>v[i];
}
sort(v+1,v+n+1);
for(int i=1; i<=n-1; i++)
{
// g<<v[i]<<" ";
if(v[i]==v[i+1])
{
k++;
}
else
{
if(k>=n/2+1)
{
g<<v[i]<<" "<<k;
ok=1;
break; //iesire fortata din for
}
k=1;
}
}
if(k>=n/2+1)
{
ok=1;
g<<v[n]<<" "<<k;
}
if(ok==0) g<<"-1";
return 0;
}
