/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 0ms 284.0 KiB
#2 Wrong Answer 0ms 392.0 KiB

Code

#include<stdio.h>
int main(){

     int n,k,i,j;
     scanf("%d%d",&n,&k);
     char arr[n];
     for(i=0;i<n;i++){
      scanf("%c",&arr[i]);
     }
     for(i=0;i<n-1;i++){
      for(j=0;j<k-i-1;j++){
            if(arr[j]>arr[j+1]){
                  int temp;
                  temp=arr[j];
                  arr[j]=arr[j+1];
                  arr[j+1]=temp;
      }
      }
      }
      for(i=0;i<n;i++){
      printf("%c",arr[i]);
     }


return 0;
}

Information

Submit By
Type
Submission
Problem
P1230 Lexicographically Smallest Rearrangement
Contest
LUCC Presents Kick & Code Intra LU Programming Contest
Language
C99 (GCC 13.2.0)
Submit At
2025-09-01 07:34:12
Judged At
2025-09-01 07:34:12
Judged By
Score
0
Total Time
0ms
Peak Memory
392.0 KiB