Cod sursa(job #2101836)
Utilizator | Data | 8 ianuarie 2018 00:02:31 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#define DM 100001
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n;
int v[1000000];
int fv[1000000];
bool exista=false;
int main ()
{
f>>n;
for(int i=0;i<n;++i){
f>>v[i];
++fv[v[i]];
}
for(int i=0;i<n;++i)
{
if(fv[v[i]]>n/2)
{
g<<v[i]<<" "<<fv[v[i]];
exista=true;
break;
}
}
if(exista==false)
g<<"-1";
}