1 数据结构课程设计小组任务1：操作系统任务调度问题

#include <iostream>
#include <vector>
#include <list>
#include <stack>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <string>
#include <sstream>
using namespace std;
struct tasks
{
	int no;
	int weight;
};
void display_all_task(vector<tasks> normal)
{
	int len = normal.size();
	int i;
	for (i = 0; i < len-1; i++)
        cout << "("<< normal[i].no << "," << normal[i].weight << "),";
	cout << "(" << normal[i].no << "," << normal[i].weight << ")\n";
}
bool cmp(tasks a, tasks b)
{
	return a.weight < b.weight;
}
int main()
{
	string str;
	getline(cin, str);
	stringstream room;
	room.str(str);
	int kk;
	int taskNumber = 0;
	vector<tasks> normal;
	while (room >> kk)
	{
		tasks tmp;
		tmp.no = taskNumber++;
		tmp.weight = kk;
		normal.push_back(tmp);
	}
	display_all_task(normal);
	vector<tasks> user;
	vector<tasks> system;
	sort(normal.begin(), normal.end(), cmp);
	for (int i = 0; i < normal.size(); i++)
	{
		if (normal[i].weight < 50)
		{
			system.push_back(normal[i]);
		}
		else if (normal[i].weight >= 50 && normal[i].weight <= 255)
		{
			user.push_back(normal[i]);
		}
	}
	cout << endl;
	int i;
	if (system.size() == 0)
        cout << "none"<<endl;
    else
    {
        for (i = 0; i < system.size(); i++)
            cout << system[i].no << " ";
        cout<<endl;
    }
    ///=======================================
	if (user.size() == 0)
        cout << "none"<<endl;
    else
    {
        for (i = 0; i < user.size(); i++)
			cout << user[i].no << " ";
        cout<<endl;
    }

}