公共钥匙盒(50分代码 求指点 晕了 我还会继续debug)

 1 #include <bits/stdc++.h>
 2 
 3 using namespace std;
 4 
 5 const int KeyNum = 1001;
 6 int key[KeyNum];
 7 int kp[KeyNum];//记录钥匙所放的位置 
 8  
 9 struct teacher{
10     int id;
11     int _time;
12 };
13 
14 bool cmp(teacher a,teacher b){
15     if(a._time==b._time){
16         return a.id < b.id;
17     }
18     return a._time<b._time;
19 }
20 
21 void re(int id,int k){//挂钥匙函数 ，还钥匙 
22     for(int i=1; i<=k; i++){
23         if(key[i]==0){
24             key[i] = id;
25             kp[id] = i;//n号钥匙放在i号挂钩处
26             break;//及时跳出，以免n号钥匙挂满所有的空钥匙钩 
27         }
28     }
29     return;
30 }
31 int main() {
32     struct teacher t1[1001],t2[1001];
33     int n,k;
34     int w,s,c;
35     std::ios::sync_with_stdio(false);
36     cin>>n>>k;
37     //cout<<"weishenme???\n";
38     for(int i=1; i<=n; i++){//初始化数组key 
39         key[i] = i;
40         kp[i] = i;
41         //cout<<"AAAA\n";
42     }
43     for(int i=0; i<k; i++){
44         //cout<<"输入循环："<<i<<endl;
45         cin>>w>>s>>c;
46         t1[i].id = w;
47         t1[i]._time = s;
48         t2[i].id = w;
49         t2[i]._time = s+c;
50         //cout<<t1[i].id<<" "<<t1[i]._time<<endl;
51     }
52     //cout<<"11111111\n";
53     sort(t1,t1+k,cmp);
54     sort(t2,t2+k,cmp);
55     /*cout<<"开始\n";
56     for(int i=0; i<k; i++){
57         cout<<t1[i].id<<" "<<t1[i]._time<<endl;
58     }
59     for(int i=0; i<k; i++){
60         cout<<t2[i].id<<" "<<t2[i]._time<<endl;
61     }
62     cout<<"结束\n";*/
63     //cout<<"k= "<<k<<endl;
64     int end_time = t2[k-1]._time;
65     //cout<<"end_time"<<end_time<<endl; 
66     //cout<<"2222222\n";
67     for(int i=0; i<=end_time; i++) {
68         //cout<<"处理循环："<<i<<endl;
69         for(int j=0; j<k; j++){//先还再取 
70             if(t2[j]._time==i)//还钥匙 
71                 re(t2[j].id,k);
72                 //cout<<"还钥匙："<<t2[j].id<<endl<<"还钥匙时间："<<t2[j]._time<<endl;
73         }
74         
75         for(int j=0; j<k; j++){//取钥匙 
76             if(t1[j]._time==i){
77                 key[kp[t1[j].id]] = 0;
78             }
79         }
80     
81     }
82     //cout<<"处理循环结束\n";
83     for(int i=1; i<=n; i++){
84         cout<<key[i]<<" ";
85     }
86     //cout<<"@@@@"<<endl;
87     return 0;
88 }