O~O

O~O

https://dazi.91xjr.com/?raceId=90618

难

hello

https://kedaoi.cn/d/SummerCamp26/blog/9094/6a7485f64267542adbb4285c

https://kedaoi.cn/d/SummerCamp26/blog/9094/6a7485f64267542adbb4285c

https://kedaoi.cn/d/SummerCamp26/blog/9094/6a7485f64267542adbb4285c

#include<bits/stdc++.h>
using namespace std;
int a[10001];
int tp,n,k; 
int main(){
	cin >> tp >> n >> k;
	for(int i = 1;i<=n;i++) cin >> a[i];
	if(tp==1){
		for(int i = 1;i<=k;i++){
			int minid = i;
			for(int j = i;j<=n;j++){
				if(a[minid]>a[j]) minid = j;
			}
			swap(a[i],a[minid]);
		}
	}else if(tp==2){
		for(int i = 1;i<=k;i++){
			for(int j = 1;j<=n-i;j++){
				if(a[j]>a[j+1]) swap(a[j],a[j+1]);
			}
		}
	}else{
		if(k==n) k = n-1;
		for(int i = 1;i<=k;i++){
			for(int j = i;j>=1;j--){
				if(a[j]>a[j+1]) swap(a[j],a[j+1]);
				else break;
			}
		}
	}
	for(int i = 1;i<=n;i++) cout << a[i] << " ";
    return 0;
}

https://kedaoi.cn/blog/9094/6a7485f64267542adbb4285c

https://kedaoi.cn/d/SummerCamp26/user/12767

@ 蒋博丞 没教养的别叫

太难了，打不完

https://dazi.91xjr.com/?raceId=90587

Hello

hello

0000000000000000000000000