Pagini recente » Cod sursa (job #2410775) | Cod sursa (job #101455) | Cod sursa (job #38773) | Cod sursa (job #1337521) | Cod sursa (job #709319)
Cod sursa(job #709319)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, v[1000010];
int main() {
int i, p = 0, k = 0, lastElem;
fin >> n;
for(i = 1; i <= n; ++i)
fin >> v[i];
for(i = 1; i <= n; ++i)
if(k == 0) {
k = 1;
lastElem = v[i];
}
else if(lastElem == v[i])
++k;
else
--k;
for(i = 1; i <= n; ++i)
if(v[i] == lastElem)
++p;
fout << lastElem << " " << p << "\n";
fout.close();
return 0;
}