import java.util.Scanner;
class Main {
public static void main (String [] args) {
Scanner sc = new Scanner(System.in);
String [] input = sc.nextLine().split(" ");
int n = Integer.parseInt(input[0]);
int k = Integer.parseInt(input[1]);
String [] input2 = new String [n];
for(int i=0;i<n;i++){
input2[i]= sc.nextLine();
}
sc.close();
for(int i=0;i<n-1;i++){
for(int j=0;j<n-1-i;j++){
String temp;
if(input2[j].compareTo(input2[j+1])>0){
temp=input2[j];
input2[j] = input2[j+1];
input2[j+1]=temp;
}
}
k=k-1;
if(k==0){
break;
}
}
for (int h = 0; h < n; h++) {
System.out.println(input2[h]);
}
}
}
7-30 字符串的冒泡排序
于 2023-10-31 17:38:54 首次发布