sicily--1306. Sorting Algorithm

#include<iostream>
#include<list>
using namespace std;

int main()
{
    int totalNum, interval;
    while(cin >> totalNum >> interval && totalNum != 0)
    {
        list<long int> numList;
        while(totalNum-- > 0)
        {
            int temp;
            cin >> temp;
            numList.push_back(temp);
        }

        numList.sort();

        list<long int>::iterator numIter;
        numIter = numList.begin();

        while(numIter != numList.end())
        {
            int count = 0;
            cout << *numIter;
            while(count != interval)
            {
                count++;
                numIter++;
                if(numIter == numList.end())
                {
                    break;
                }
            }

            if(numIter == numList.end())
            {
                break;
            }
            else
            {
                cout << " ";//最后一个不输出空格
            }

        }
        cout << endl;
    }
    
    
    return 0;

}