Cod sursa(job #1886903)
Utilizator | Data | 21 februarie 2017 11:16:04 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int ap[1000001],n,i,x,M;
int main ()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
if(x>M)
M=x;
ap[x]++;
}
for(i=1;i<=M;i++)
{
if(ap[x]==n/2+1)
{
g<<x<<" "<<ap[x];
break;
}
}
return 0;
}