Cod sursa(job #999338)
| Utilizator | Data | 19 septembrie 2013 22:22:55 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
int main(){
const int a=1000001;
int v[a],n,i,j,nr,nr_aparitii=0,max=0;
ifstream f("elmaj.in");
f>>n;
for(i=0;i<n;i++)
f>>v[i];
f.close();
for(i=0;i<n;i++){
max=0;
for(j=i;j<n;j++)
if(v[i]==v[j])
max++;
if(max>nr_aparitii){
nr_aparitii=max;
nr=v[i];
}
}
ofstream g("elmaj.out");
g<<nr<<' '<<nr_aparitii;
g.close();
return 0;
}
