1014 Waiting in Line

#include<bits/stdc++.h>
using namespace std;
const int INF=1000000000;
struct Node{
	int start;
	int time;
	int id;
};
struct Window{
	int poptime;
	int endtime;
	queue<int> q;
}windows[21]; 
int main()
{
	freopen("in.txt","r",stdin);
	int n,m,k,q;
	cin>>n>>m>>k>>q;vector<Node> ppp;ppp.resize(k);
	for(int i=0;i<k;i++){
		cin>>ppp[i].time;
		ppp[i].id=i+1;
	}
	for(int i=0;i<n;i++){
		windows[i].endtime=8*60;
		windows[i].poptime=8*60;
	}
	if(n*m>=k){
		for(int i=0;i<k;i++){
			if(windows[i%n].q.empty()==true){
				windows[i%n].poptime+=ppp[i].time;
			}
			windows[i%n].q.push(i);
			ppp[i].start=windows[i%n].endtime;
			windows[i%n].endtime+=ppp[i].time;
		}
	}else{
		for(int i=0;i<n*m;i++){
			if(windows[i%n].q.empty()==true){
				windows[i%n].poptime+=ppp[i].time;
			}
			windows[i%n].q.push(i);
			ppp[i].start=windows[i%n].endtime;
			windows[i%n].endtime+=ppp[i].time;
		}
		for(int i=n*m;i<k;i++){
			int k=-1;int minendtime=INF;
			for(int j=0;j<n;j++){
				if(windows[j].poptime<minendtime){
					minendtime=windows[j].poptime;
					k=j;
				}
			}
			windows[k].q.pop();
			windows[k].q.push(i);
			if(windows[k].endtime<17*60)
			ppp[i].start=windows[k].endtime;
			else
			ppp[i].start=-1;
			windows[k].poptime+=ppp[windows[k].q.front()].time;
			windows[k].endtime+=ppp[i].time;
		}
	}
	for(int i=0;i<q;i++){
		int temp;cin>>temp;
		if(ppp[temp-1].start!=-1){
			printf("%02d:%02d\n",(ppp[temp-1].start+ppp[temp-1].time)/60,(ppp[temp-1].start+ppp[temp-1].time)%60);
		}else{
			cout<<"Sorry"<<endl;
		}
	}
	return 0;
}

26分飘过待解决。。。