Cod sursa(job #2162887)
| Utilizator | Data | 12 martie 2018 15:29:24 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, i, el, k, v[1000001];
int main()
{
f >> n;
for(i=1;i<=n;i++)
f >> v[i];
el=v[1];
k=1;
for(i=2;i<=n;i++){
if(v[i]==el) k++;
else k--;
if(k<0){
k=1;
el=v[i];
}
}
k=0;
for(i=1;i<=n;i++)
if(v[i]==el) k++;
if(k<n/2+1) g << -1 << '\n';
else g << el << " " << k << '\n';
return 0;
}
