PTA 基础编程题目集 7-30 字符串的冒泡排序

#include<iostream>
#include<string>
using namespace std;
int main(){
	string arry[101], pt;
	int N, K;
	cin >> N >> K;
	for (int i = 1; i <=N; i++)
		cin >> arry[i];
	for(int i=1;i<=K;i++)
		for (int j =1; j <= N- i; j++)
			if (arry[j] > arry[j + 1])
			{
				pt = arry[j + 1]; arry[j + 1] = arry[j]; arry[j] = pt;
			}
	for (int i = 1; i <= N; i++)
	{
		if (i != 1)  cout << endl;
		cout << arry[i];
	}
}