codeforces#744(div.3)

#include
using namespace std;
int main()
{
    int n,a,b,c;
    string s;
    cin>>n;
    while(n--)
    {
        a=0,b=0,c=0;
        cin>>s;
        for(int i=0;i 
B. Shifting Sort
 
#include
using namespace std;
int main()
{
    int i,j,t,n,l[60],r[60],k[60],count,a[100],b[100];
    cin>>t;
    while(t--)
    {
        cin>>n;count=0;
        for(i=1;i<=n;i++)
        {
            cin>>a[i];b[i]=a[i];
        }
        sort(a+1,a+1+n);
        for(i=1;i<=n;i++)
        {
            if(a[i]!=b[i])
            {
                count++;
                for(j=i+1;j<=n;j++)
                {
                    if(b[j]==a[i])break;
                }
                l[count]=i,r[count]=j,k[count]=r[count]-l[count];
                int temp;temp=b[r[count]];
                for(int q=r[count];q>l[count];q-- )
                {
                    b[q]=b[q-1];
                }
                b[l[count]]=temp;
                //for(int q=1;q<=n;q++)cout< 
 
E1. Permutation Minimization by Deque
 
#include
using namespace std;
#define ll long long
const int maxn=2e5+5;
 
void solve()
{
	int n;
	cin>>n;
	vectora(n+1),c(4*n+10);
	for(int i=1;i<=n;i++)cin>>a[i];
	int head1=n*2,head2=n*2;
	c[head1]=a[1];
	for(int i=2;i<=n;i++)
	{
		if(a[i]<=c[head1])c[--head1]=a[i];
		else c[++head2]=a[i];
	}
	for(int i=head1;i<=head2;i++)cout<>t;
	while(t--)solve();
	return 0;
}