#include
#include
#include??
#include???
#include?
using?namespace?std;?
const?int?INF?=?0x7fffffff;??

struct?node?{
	int?num;
	int?atime;
	int?wtime;
	int?youxian;
	int?timechip;
}
pcb;
int?n;
struct?node?pro[100];
bool?vis[100];?

struct?yunxing{
	int?xu;//調(diào)度序號(hào)
	int?num;
	int?stime;?
	int?etime;??
	int?youxian;??
}process;

node?qu[100];//就緒隊(duì)列??
int?he;//就緒隊(duì)列頭部???
int?ta;//就緒隊(duì)列尾部?

void?FCFS（）;//先來先服務(wù)調(diào)度算法??
void?SPF_N（）;//不可剝奪的短作業(yè)優(yōu)先調(diào)度算法??
void?SPF_P（）;//可剝奪的短作業(yè)優(yōu)先調(diào)度算法??
void?RR（）;//時(shí)間片輪轉(zhuǎn)調(diào)度算法??
void?PRI（）;//動(dòng)態(tài)優(yōu)先級(jí)調(diào)度算法??

bool?fcfscmp（node?a?node?b）;??
//先來先服務(wù)算法進(jìn)程排序規(guī)則，先按照到達(dá)時(shí)間升序，再按照進(jìn)程號(hào)升序排列??
bool?spfcmp（node?a?node?b）;??
//短作業(yè)優(yōu)先算法進(jìn)程排序規(guī)則，先按照到達(dá)時(shí)間升序，再按照運(yùn)行時(shí)間升序，再按進(jìn)程號(hào)升序排列
bool?rrcmp（node?a?node?b）;??
//時(shí)間片輪轉(zhuǎn)算法進(jìn)程排序規(guī)則，先按照到達(dá)時(shí)間升序，再按照進(jìn)程號(hào)升序排列??
bool?pricmp（node?a?node?b）;??
//動(dòng)態(tài)優(yōu)先級(jí)算法進(jìn)程排序規(guī)則，先按照進(jìn)程優(yōu)先數(shù)升序，再按到達(dá)時(shí)間升序，再按進(jìn)程號(hào)升序排列??

int?main（）
{
	n=0;
	int?suanfa=0;
	scanf（“%d“?&suanfa）;
	while?（scanf（“%d/%d/%d