#include<bits/stdc++.h> using namespace std; typedef struct Node { int id; int num; }Room; int main() { int NUM ; int i = 0; int j = 0; int num = 0; int flag = 0; cin >> NUM; cin.get(); Room *student = new Room[NUM] ; for(i = 0; i < NUM; i++) { student[i].id = 0; student[i].num = 0; } for(i = 0; i < NUM; i++) { cin >> num; cin.get(); for(j = 0; j < NUM;j++) { if(student[j].id == num) { student[j].num ++; break; } } if(j == NUM) { student[flag].id = num; student[flag].num ++; flag ++; } } Room tmp; for(i=0;i< NUM;i++) { for(j=i+1;j < NUM;j++) { if(student[i].num < student[j].num) { tmp = student[i]; student[i] = student[j]; student[j] = tmp; } else if(student[i].num == student[j].num) { if(student[i].id > student[j].id) { tmp = student[i]; student[i] = student[j]; student[j] = tmp; } } } } for(i = 0; i < flag-1; i++) { cout << student[i].id << "->"; } cout << student[flag-1].id << endl; delete [] student; return 0; }