Cod sursa(job #1323998)
Utilizator | Data | 21 ianuarie 2015 18:14:06 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long v[1000000];
int main()
{
int n,nr;
f>>n;
int k;
k=n/2;
for(int i=1;i<=n;i++)
f>>v[i];
for(int i=1;i<=n;i++)
{
nr=0;
for(int j=1;j<=n;j++)
if(v[i]==v[j])
nr++;
if(nr>k)
{
g<<v[i]<<" "<<nr ;
k=-1 ;break;
}
}
if(k!=-1)
g<<-1;
return 0;
}