JXNVCE ALGO-LOG YouJin Jung

BOJ-11651

간단한 수학 정렬 알고리즘문제

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    
    int N;
    cin >> N;
    
    vector<vector<int>> arr(N, vector<int>(2,0));
    
    for(int i=0; i<N; i++){
        cin >> arr[i][1];
        cin >> arr[i][0];
    }
    sort(arr.begin(), arr.end());

    for(int i=0; i<arr.size(); i++) 
        cout << arr[i][1]<< " " << arr[i][0] << endl;
    
    return 0;
}