1. vector로 풀기
vector로 푸는게 시간도 메모리도 더 적게걸림.
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector <int> arr;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
arr.push_back(tmp);
}
sort(arr.rbegin(), arr.rend());
for (int i = 0; i < N; i++) cout << arr[i] << '\n';
return 0;
}
|
cs |
2.set으로 풀기
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
|
#include <set>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
set <int> arr;
while (N--){
int tmp;
cin >> tmp;
arr.insert(tmp);
}
for (auto it = arr.rbegin(); it != arr.rend(); it++)
cout << *it << '\n';
return 0;
}
|
cs |