BOJ 10973 - 이전 순열 [C++]

문제

링크

풀이

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
void solve(void) {
  int n; cin >> n;
  vector<int> v(n);
  for (int i=0; i<n; i++) cin >> v[i];
 
  if (prev_permutation(v.begin(), v.end())) {
    for (int i=0; i<n; i++) cout << v[i] << " ";
  } else {
    cout << "-1";
  }
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}