백준 소스코드 [C++] 2283 구간 자르기

www.acmicpc.net/problem/2283

2283번: 구간 자르기

백준 소스코드 [C++] 2283 구간 자르기

#include <iostream>
#include <algorithm>
#include <queue>
#include <string.h>
#include <limits.h>
#include <vector>
#include <math.h>
#include <stack>
#include <bitset>
#include <string>
#include <set>
#define all(v) v.begin(), v.end()
#define pii pair<int,int>
#define make_unique(v) v.erase(unique(v.begin(), v.end()), v.end())
typedef long long ll;
using namespace std;
int num[1000001];
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n, m,L,R;
	cin >> n >> m;
	
	while (n--) {
		cin >> L >> R;
		for (int i = L+1;i <= R;i++) num[i]++;
	}

	int l = 0, r = 0,sum=0, resL = 0, resR = 0;
	while (true) {
		if (sum > m) sum -= num[++l];
		else if (r == 1000001) break;
		else sum += num[++r];

		if (sum == m) {
			resL = l, resR = r;
			break;
		}
	}
	cout << resL << " " << resR;

	return 0;
}