[Baekjoon/백준] 11004번, 2751번, 11931번(C/C++) / (알게된 내용X)

 

 

 

§ my solution 

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    int N, A;   cin >> N >> A;
    vector<int> v;
    for (int i = 0; i < N; i++) {
        int num;    cin >> num;
        v.push_back(num);
    }
    sort(v.begin(), v.end());
    cout << v[A-1];
}

 

 

 

 

 

 

 

 

 

§ my solution 

- endl 대신 '\n'을 애용하자!

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int N;  cin >> N;
    vector<int> v;
    for (int i = 0; i < N; i++) {
        int num;    cin >> num;
        v.push_back(num);
    }
    sort(v.begin(), v.end());
    for(auto x:v)
        cout << x << '\n';
}

 

 

 

 

 

§ my solution 

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int N; cin >> N;
    vector<int> v;
    for (int i = 0; i < N; i++) {
        int num;    cin >> num;
        v.push_back(num);
    }
    sort(v.begin(), v.end(), greater<int>());
    for(auto x:v)
        cout << x << '\n';
}