题目链接3169.无需开会的工作日思路排序题解链接Wiki关键点无时间复杂度\(O(n\logn)\)空间复杂度\(O(1)\)代码实现：classSolution:defcountDays(self,days:int,meetings:List[List[int]])->int:meetings.sort()an

解法一：循环倒叙一个个找#include<bits/stdc++.h>#definef(i,s,e)for(inti=s;i<=e;i++)#definelllonglongusingnamespacestd;constintN=1e3+10,inf=0x3f3f3f3f;intmain(){intn,m;cin>>n>>m;for(inti=n;i>=1