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