Cod sursa(job #2408270)
| Utilizator | Data | 17 aprilie 2019 19:19:24 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,a[1000001],nr;
bool ok=false;
int main()
{
f>>n;
for(int i=1; i<=n; i++)
f>>a[i];
for(int i=1; i<n; i++)
{
if(a[i])
{
nr=1;
for(int j=1+i; j<=n; j++)
{
if(a[i]==a[j])
{
a[j]=0;
nr++;
}
}
int x=n/2;
if(nr>=x)
g<<a[i]<<' ',ok=true;
nr=0;
}
}
if(ok==false)
g<<"-1";
return 0;
}
