Submission #1128300

#	Time	Username	Problem	Language	Result	Execution time	Memory
1128300		aarpen	버블 정렬 (OJUZ10_bubblesort)	C++20	0 / 100	15 ms	1052 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;
 bool swapped = false;
for (int l = 0; l < po; l++) {
    if (seq[l] > seq[l + 1]) {
        swap(seq[l], seq[l + 1]);
        swapped = true;
    }

if (!swapped) break; // Exit early if no swaps
}
    for(int ll = 0; ll < N; ll++){
       cout << seq[ll] << " ";
    }
}

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