Submission #14119

#TimeUsernameProblemLanguageResultExecution timeMemory
14119kyungjun2버블 정렬 (OJUZ10_bubblesort)C++98
0 / 100
26 ms1744 KiB
#include<stdio.h>
int main(){
	long long int n,k,i,j;
	scanf("%lld %lld",&n,&k);
	long long int arr[n];
	for(i=0;i<n;i++){
		scanf("%lld",&arr[i]);
	}
	for(i=0;i<=n*k;i++){
		if(arr[i+1]<arr[i]){
			int t=arr[i+1];
			arr[i+1]=arr[i];
			arr[i]=t;
		}
	}
	for(i=0;i<n;i++){
		printf("%lld ",arr[i]);
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...