Pagini recente » Cod sursa (job #2809198) | Cod sursa (job #1481604) | Cod sursa (job #2206264) | tema | Cod sursa (job #2547911)
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main()
{
int n,v[100005],max=0,ap,s,maxs;
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
for(int j=n;j>=n/2;j--){
ap = 1;
if(v[j]!=-1){
for(int k=j-1;k>=1;k--){
if(v[k]==v[j]){
ap++;
s=v[k];
v[k] = -1;
}
}
if(ap>=n/2+1){
max=ap;
maxs=s;
}
}
}
fout<<maxs<<" "<<max;
return 0;
}