Cod sursa(job #2163625)
Utilizator | Data | 12 martie 2018 19:12:38 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int N,v[1000001];
int main()
{
f>>N;
for(int i=1;i<=N;++i)f>>v[i];
sort(v+1,v+N+1);
int i=1;
while(i<N){
int j=i;
while(j<N&&v[i]==v[j])++j;
if(j-i+1>N/2){
g<<v[i]<<' '<<j-i+1;
return 0;
}
i=j+1;
}
g<<-1;
return 0;
}