Pagini recente » Cod sursa (job #2196530) | Cod sursa (job #1803545) | Cod sursa (job #1556606) | Cod sursa (job #1244332) | Cod sursa (job #1947405)
#include <bits/stdc++.h>
using namespace std;
const int penis=1e6;
struct draguuuutz{
long long int numar;
int aparitii;
}v[penis];
int main(){
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int N, j, element=0;
fin>>N;
fin>>v[0].numar;
for(int i=1; i<N; i++){
kek:
fin>>v[i].numar;cout<<i<<" ";
j=0;
while(true){
if(j==i)
break;
if(v[j].numar==v[i].numar){
v[j].aparitii++;
if(v[j].aparitii>=N/2+1)
element=j;
v[i].numar=0;
goto kek;
}
j++;
}
}
if(element==0)
fout<<-1;
else
fout<<v[element].numar<<" "<<v[element].aparitii;
}