数据结构---字符串插入

地址：
http://dsa.openjudge.cn/linearlist/0203/

#include "pch.h"
#include <iostream>
#include<string>
using namespace std;

int main()
{
    char s1[100],s2[100];
	cin >> s1 >> s2;
	int len = strlen(s1);
	int max = len-1;
	int len1 = strlen(s2);
	for (int i = max - 1;i >= 0;i--)
	{
		if (s1[max] <= s1[i])
			max = i;
	}
	for (int i = len - 1;i >max;i--)
	{
		s1[i + len1] = s1[i];
	}
	int k = 0;
	for (int i = max + 1;i <= max + len1;i++)
	{
		s1[i] = s2[k];
		k++;
	}
	for (int i = 0;i < len + len1;i++)
		cout << s1[i];
	return 0;
}