VIP 题目 很恶心的
强烈建议手动模拟 锻炼思维
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 7, INF = 0x7f7f7f7f;
int n, k, vip;
int b[11] = {0};
int cnt[11] = {0};
struct node {
int t, p, vi;
int len;
} a[maxn];
bool vis[11][60*maxn] = {false};
bool viss[maxn] = {false};
void init() {
scanf("%d", &n);
for(int i = 0; i < n; ++i) {
//scanf("%d %d %d", &a[i].t, &a[i].p, &a[i].vi);
scanf("%d %d %d", &a[i].t, &a[i].p, &a[i].vi);
//cout << a[i].t << ' ' << a[i].p << " " << a[i].vi << endl;
if(a[i].p > 60) a[i].p = 60;
}
scanf("%d %d", &k, &vip);
vip++;
}
void solve() {
for(int i = 0; ; ++i ) {
int ff = 1;
for(int