我用的是数组，如果a[n-1]<m,就直接让a[n-1]==m。如果a[i]>m，就让比m大的全部后退一位。提交总是输出超限，大牛看看我的思维对吗？

贴代码看看

你是想用快速排序算法么？

就是这个，麻烦帮我看看，一直超限。

#include<stdio.h>
int main()
{
    int n, m, i, j, a[1000] = {0};
    while (scanf("%d%d",&n,&m)!=EOF)
    {
        if (n == 0 && m == 0)
            break;
        for (i = 0; i<n; i++)
            a[i] = 2 * (i + 1);
            for (i = 0; i < n; i++)
            {
                if (a[i] > m)
                {
                    for (j = n - 1; j > i; j--)
                        a[j] = a[j - 1];
                        a[i] = m;
                        break;
                }
                a[n - 1] = m;
            }
        for (j = 0; j<n; j++)
            printf("%d ", a[j]);
        printf("\n");
    }
    return 0;
}

#include<stdio.h>
int main()
{
    int n, m, i, j, a[1000] = {0};
    while (scanf("%d%d",&n,&m)!=EOF)
    {
        if (n == 0 && m == 0)
            break;
        for (i = 0; i<n; i++)
            a[i] = 2 * (i + 1);
            for (i = 0; i < n; i++)
            {
                if (a[i] > m)
                {
                    for (j = n - 1; j > i; j--)
                        a[j] = a[j - 1];
                        a[i] = m;
                        break;
                }
                a[n - 1] = m;
            }
        for (j = 0; j<n; j++)
            printf("%d ", a[j]);
        printf("\n");
    }
    return 0;
}