Pagini recente » Cod sursa (job #5048) | Cod sursa (job #27136) | Istoria paginii home | Cod sursa (job #218366) | Cod sursa (job #3187056)
#include <iostream>
#include <fstream>
using namespace std;
int f(int n, int v[]){
for (int i = 0; i < n; i++) {
int nr = 0;
for (int j = 0; j < n; j++) {
if (v[j]==v[i])
nr++;
}
if (nr > n / 2)
return v[i];
}
return -1;
}
int f2(int n, int v[], int k){
int db=0;
for(int i=0;i<n;i++){
if(v[i]==k) db++;
}
return db;
}
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main()
{
int n;
fin>>n;
int v[n];
for(int i=0;i<n;i++){
fin>>v[i];
}
int k=f(n,v);
fout<<k<<" ";
fout<<f2(n,v,k);
return 0;
}