Submission #6,130

2023-11-02 23:59:47

cpp17

Accepted 35/35

71ms

12640 KiB

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,m;
    cin>>n>>m;
    vector<int> pf(n+2,0);
    for (int i=0; i<m;i++){
        int a,b;
        cin>>a>>b;
        pf[a]++;
        pf[a+1]++;
        pf[b+1]--;
        pf[b]--;
    }
    int now=0,ans=0;
    int ansh=0;
    for (int i=0; i<=n+1;i++){
        now+=pf[i];
        if (now>ans){
            ans=now;
            ansh=i;
        }
    }
    cout<<ansh<<" "<<ans;
}

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	3ms	1808 KiB
		2	Accepted	0/0	70ms	3884 KiB
		3	Accepted	1/1	3ms	3400 KiB
		4	Accepted	1/1	3ms	3596 KiB
		5	Accepted	1/1	3ms	3804 KiB
		6	Accepted	1/1	2ms	3900 KiB
		7	Accepted	1/1	3ms	4132 KiB
		8	Accepted	2/2	3ms	4352 KiB
		9	Accepted	2/2	3ms	4340 KiB
		10	Accepted	2/2	3ms	4448 KiB
		11	Accepted	2/2	4ms	4736 KiB
		12	Accepted	2/2	4ms	4656 KiB
		13	Accepted	2/2	4ms	4704 KiB
		14	Accepted	2/2	4ms	5060 KiB
		15	Accepted	2/2	6ms	5280 KiB
		16	Accepted	2/2	67ms	6760 KiB
		17	Accepted	2/2	68ms	8080 KiB
		18	Accepted	2/2	7ms	8184 KiB
		19	Accepted	2/2	8ms	8532 KiB
		20	Accepted	2/2	61ms	9960 KiB
		21	Accepted	2/2	71ms	11136 KiB
		22	Accepted	2/2	68ms	12640 KiB