Submission #1128295

#	Time	Username	Problem	Language	Result	Execution time	Memory
1128295		aarpen	버블 정렬 (OJUZ10_bubblesort)	C++20	34 / 100	1095 ms	960 KiB

bubblesort

#include<bits/stdc++.h>
using namespace std;

int main(){
    int N, K;
    cin >> N;
    cin >> K;
    vector<int> seq;
    for(int i = 0; i < N; i++){
        int temp;
        cin >> temp;
        seq.push_back(temp);
    }
    int po;
    po = N - 1;
    for (int z = 0; z < K; z++){
        for(int l = 0; l < po; l++){
            if(seq[l] > seq[l + 1]){
                swap(seq[l], seq[l + 1]);
            }
        }
        po--;
    }
    for(int ll = 0; ll < N; ll++){
       cout << seq[ll] << " ";
    }
}

• Subtask 1: 11 / 11
• Subtask 2: 23 / 23
• Subtask 3: 0 / 47
• Subtask 4: 0 / 19