Cod sursa(job #1324050)
Utilizator | Data | 21 ianuarie 2015 19:15:23 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
int main()
{
int x[1000],i,j,cont,n,maxx,emaj;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
for(i=0;i<n;i++)
f>>x[i];
maxx=0;
for(i=0;i<n;i++)
{
cont=0;
for(j=i+1;j<n;j++)
if(x[i]==x[j])
cont++;
if(cont>maxx)
{
maxx=cont;
emaj=x[i];
}
}
g<<emaj<<' '<<maxx+1;
return 0;
}