7-19 寻找大富翁 (25分)（c++）（归并排序）

今天药忘吃喽~ 2022-12-19 13:13 85阅读 0赞

自己的归并排序写的不好。  
主要是提醒一下第三个测试点，m > n时, 要修改m的值  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ1NTkxODEz_size_16_color_FFFFFF_t_70_pic_center]

#include <iostream>
    #include <cstdlib>
    
    using namespace std;
    const int MAXNUM = 1100000;
    
    long int arr[MAXNUM];
    long int temp[MAXNUM];
    //合并
    void Merge(int st, int mid, int ed)
    {
        
        int i = st, j = mid + 1;
        int k = st;
        for (; i <= mid && j <= ed; k++)
        {
        
            if (arr[i] > arr[j])
            {
        
                temp[k] = arr[i];
                i++;
            }
            else
            {
        
                temp[k] = arr[j];
                j++;
            }
        }
        while (i <= mid)
        {
        
            temp[k] = arr[i];
            k++;
            i++;
        }
        while (j <= ed)
        {
        
            temp[k] = arr[j];
            k++;
            j++;
        }
        for (int k = st; k <= ed; k++)
            arr[k] = temp[k];
    }
    //
    void MergeSort(int st, int ed)
    {
        
        if (st < ed)
        {
        
            int mid = (st + ed) / 2;
            MergeSort(st, mid);
            MergeSort(mid + 1, ed);
            Merge(st, mid, ed);
        }
    }
    
    int main()
    {
        
        //ios::sync_with_stdio(false);
        int n, m;
        cin >> n >> m;
        for (int i = 0; i < n; i++)
            cin >> arr[i];
        MergeSort(0, n-1);
        //这里
        if (m > n) m = n;
        for (int i = 0; i < m; i++)
        {
        
            if (i) cout << " ";
            cout << arr[i];
        }
        cout << endl;
        system("pause");
        return 0;
    }

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ1NTkxODEz_size_16_color_FFFFFF_t_70_pic_center]: /images/20221120/f205eedba95f4c9ca6b83700da6eec88.png