ACWING区间合并

#include 
#include 
#include 

using namespace std;

typedef pairPII;

const int N=300010;

int n,m;
vectoralls;
int s[N];
PII add[N],seg[N];

int find(int x)
{
    int l=0,r=alls.size()-1;
    while (l>1;
        if(alls[mid]>=x)r=mid;
        else l=mid+1;
    }
    return r+1;
}

int main(){
    scanf("%d%d",&n,&m);
    for(int i=0;i