BOJ 5648 - 역원소 정렬 [C++]

문제

링크

풀이

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
 
void solve(void) {
  int n; cin >> n;
 
  vector<long long> v(n);
  for (int i=0; i<n; i++) {
    string s; cin >> s;
    reverse(s.begin(), s.end());
    v[i] = stoll(s);
  }
 
  sort(v.begin(), v.end());
  for (int i=0; i<n; i++) cout << v[i] << "\n";
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}