# [Bronze II] Sort of Sort [문제 링크](https://www.acmicpc.net/problem/33654) ## 문제 설명 <p>Sorting takes so long... but if we don’t mind losing some data we can sort of sort much faster!</p> <p>A sort of sorted list is a monotonically increasing list containing all elements of another list $a$ that were originally in sorted order. That is, a sort of sorted list obtained from list $a$ contains all $a_i$ such that $a_i≥a_j$ for all $0≤j<i$.</p> ## 입력 <p>The first line of input contains a single integer $N$, the length of the unsorted list ($1≤N≤100,000$). The next line contains $N$ space separated integers $a_i$ ($-200,000≤a_i≤200,000$).</p> ## 출력 <p>Output a single line of space separated integers representing the sort of sorted list obtained from the given list $a$.</p> ## 풀이 #### 입력받은 N개의 수를 오름차순이 되도록 삭제한 후 출력하면 된다. ``` c++ #include<bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int last=-200000; while(n--) { int cur; cin >> cur; if(last<=cur) { cout << cur << ' '; last = cur; } } } ```