Pagini recente » Cod sursa (job #333798) | Cod sursa (job #1340170) | Cod sursa (job #1694371) | Cod sursa (job #2419263) | Cod sursa (job #639844)
Cod sursa(job #639844)
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int main()
{int n,maxim,ind,var;
in>>n;
vector<int> v(n);
vector<int> siz(2<<20);
for(size_t i=0;i<n;i++)
siz[i]=0;
for(size_t i=0;i<n;i++)
in>>v[i];
sort(v.begin(),v.end());
for(size_t i=0;i<n-1;i++)
if(v[i]==v[i+1])
siz[v[i]]++;
else
if(v[i]!=v[i+1])
siz[v[i]]++;
maxim=0;
for(size_t j=0;j<n;j++)
{
if(siz[j]>maxim)
{
maxim=siz[j];
ind=j;
}
}
out<<ind<<" "<<maxim;
}