Submission #1358122

#	Time	Username	Problem	Language	Result	Execution time	Memory
1358122		kmath628	버블 정렬 (OJUZ10_bubblesort)	C++20	0 / 100	7 ms	836 KiB

bubblesort

#include <bits/stdc++.h>
using namespace std;
int a[100009];
void recur(int l, int r, int k){
    if(l>r) return;
    if(k==0){
        for(int i=l;i<=r;i++) printf("%d ",a[i]);
        return;
    }
    int m=l;
    for(int i=l+1;i<=r;i++){
        if(a[i]>=a[m]) m=i;
    }
    recur(l,m-1,k);
    recur(m+1,r,k-1);
    printf("%d ",a[m]);
}
int main(){
    int n,k,i;
    scanf("%d %d",&n,&k);
    for(i=1;i<=n;i++) scanf("%d",&a[i]);
    recur(1,n,k); return 0;
}

Compilation message (stderr)

bubblesort.cpp: In function 'int main()':
bubblesort.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     scanf("%d %d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~~
bubblesort.cpp:21:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     for(i=1;i<=n;i++) scanf("%d",&a[i]);
      |                       ~~~~~^~~~~~~~~~~~

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