Cod sursa(job #1536385)
Utilizator | Data | 26 noiembrie 2015 01:55:40 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int N=1000004;
int v[1000004];
int u[1000004];
f>>N;
for (int i = 0 ; i < N ; i++)
{
f>>v[i];
u[v[i]]++;
}
for (int i = 0 ; i < N; i++)
if(u[i] >= N/2 + 1)
{
g<<i<<" "<<u[i]<<endl; break;
}
return 0;
}