Submission #7,139

2023-12-31 12:55:26

cpp17

Accepted 75/75

86ms

5792 KiB

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m;
	cin >> n >> m;
	vector<pair<int, int>> aruk(m);
	for (int i = 0; i < m; i++) {
		cin >> aruk[i].first >> aruk[i].second;
	}
	
	sort(aruk.begin(), aruk.end());
	int db = 0, veg = 1;
	for (int i = 0; i < m; i++) {
		if (aruk[i].first > veg) db += aruk[i].first - veg;
		veg = max(veg, aruk[i].second);
	}

	cout << db + n - veg;
}

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	3ms	1808 KiB
		2	Accepted	0/0	86ms	3424 KiB
		3	Accepted	3/3	3ms	2220 KiB
		4	Accepted	3/3	3ms	2428 KiB
		5	Accepted	3/3	3ms	2784 KiB
		6	Accepted	3/3	3ms	2928 KiB
		7	Accepted	3/3	3ms	3140 KiB
		8	Accepted	4/4	3ms	3120 KiB
		9	Accepted	4/4	3ms	3116 KiB
		10	Accepted	4/4	3ms	3180 KiB
		11	Accepted	4/4	3ms	3312 KiB
		12	Accepted	4/4	3ms	3400 KiB
		13	Accepted	4/4	7ms	3816 KiB
		14	Accepted	4/4	8ms	4044 KiB
		15	Accepted	4/4	7ms	3960 KiB
		16	Accepted	4/4	8ms	4236 KiB
		17	Accepted	4/4	8ms	4324 KiB
		18	Accepted	4/4	9ms	4268 KiB
		19	Accepted	4/4	8ms	4404 KiB
		20	Accepted	4/4	9ms	4496 KiB
		21	Accepted	4/4	78ms	5536 KiB
		22	Accepted	4/4	82ms	5792 KiB