Pagini recente » Cod sursa (job #2378955) | Cod sursa (job #3242853) | Cod sursa (job #2615107) | Cod sursa (job #1889789) | Cod sursa (job #2636912)
#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
using namespace std;
vector<int> v;
int n;
int main()
{
ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");
fin >> n;
v.resize(n);
for (int i=0; i<n; i++)
{
fin >> v[i];
}
int elmaj=0;
int p=0;
for (int i=0; i<v.size(); i++)
{
if (p==0)
{
elmaj=v[i];
p=1;
continue;
}
if (elmaj==v[i])
p++;
else
p--;
}
int k=0;
for (int i=0; i<v.size(); i++)
{
if (v[i]==elmaj)
k++;
}
if (k>n/2)
fout << elmaj << " " << k;
return 0;
}