进程调度（优先级调度）-----编程模拟实现HRRN调度算法

#include<bits/stdc++.h>
using namespace std;


const int N = 1111;
int n, cnt = 1;
float s;	//当前时间
struct work
{
	int name;	//作业号
	float sumit_time;	//提交时刻
	float run_time;	//运行时间
	float s_time;	//开始时间
	float e_time;	//结束时间

	int st;	//标记运行顺序；
	float R;	//响应比

}w[N];

bool cmp1(work a, work b)
{
	return a.R < b.R;
}
bool cmp2(work a, work b)
{
	return a.st < b.st;
}


void RR()
{
	for (int i = 0; i <= n; i++)
	{
		if (!w[i].st && s >= w[i].sumit_time)
			w[i].R = (s - w[i].sumit_time + w[i].run_time) / w[i].run_time;
	}
}

void HRRN()
{
	for (int i = 1; i < n; i++)
	{
		RR();
		sort(w + 1, w + n + 1, cmp1);
		for (int j = n; j > 0; j--)
		{
			if (!w[j].st)
			{
				w[j].st = cnt++;
				w[j].s_time = s;
				w[j].e_time = s + w[n].run_time;
				s = w[j].e_time;
				break;
			}
		}
	}

	sort(w + 1, w + n + 1, cmp2);
	printf("调度顺序为："); 
	for (int i = 1; i <= n; i++)
		printf("%d  ", w[i].name);

}

int  main()
{
	int mintime = 111, f;
	printf("请问共有几个作业:");
	scanf("%d", &n);
	printf("作业号	提交时刻（时）	运行时间(小时)\n");
	for (int i = 1; i <= n; i++)
	{
		w[i].st = 0;
		int h, m;
		scanf("%d%d:%d%f", &w[i].name, &h, &m, &w[i].run_time);		
		w[i].sumit_time =  h + 0.01 * m * 5 / 3;    //时间转换
        //找出第一个作业
		if (w[i].sumit_time < mintime)	f = i, mintime = w[i].sumit_time;
		else if (w[i].sumit_time == mintime && w[i].run_time < w[f].run_time)	f = i;
	}

	//第一个作业
	w[f].st = cnt++;
	w[f].s_time = w[f].sumit_time;
	w[f].e_time = w[f].sumit_time + w[f].run_time;
	s = w[f].e_time;
	HRRN();
	
	return 0;
}

结果截图：