알고리즘, 코테 준비
백준 14594
Multitab
2022. 6. 23. 16:16
https://www.acmicpc.net/problem/14594
#include <iostream>
using namespace std;
int main() {
int N, M;
int ranX[100];
int ranY[100];
int cnt = 0;
bool wall[101];
fill_n(wall, 100, true);
cin >> N;
cin >> M;
for(int i = 0; i < M; i++){
cin >> ranX[i] >> ranY[i];
}
//입력단
for(int i = 0; i < M; i++) {
for (int j = ranX[i]; j < ranY[i]; j++) {
wall[j] = false;
}
}
for(int i = 0; i < N; i++) {
if(wall[i]){
cnt += 1;
}
}
std::cout << cnt << "\n";
return 0;
}