Codeforces Round #501(Div.3) A(폭력)

A. Points in Segments
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given a set of nn segments on the axis OxOx, each segment has integer endpoints between 11 and mm inclusive. Segments may intersect, overlap or even coincide with each other. Each segment is characterized by two integers lili and riri (1≤li≤ri≤m1≤li≤ri≤m) — coordinates of the left and of the right endpoints.
Consider all integer points between 11 and mm inclusive. Your task is to print all such points that don't belong to any segment. The point xxbelongs to the segment [l;r][l;r] if and only if l≤x≤rl≤x≤r.
Input
The first line of the input contains two integers nn and mm (1≤n,m≤1001≤n,m≤100) — the number of segments and the upper bound for coordinates.
The next nn lines contain two integers each lili and riri (1≤li≤ri≤m1≤li≤ri≤m) — the endpoints of the ii-th segment. Segments may intersect, overlap or even coincide with each other. Note, it is possible that li=rili=ri, i.e. a segment can degenerate to a point.
Output
In the first line print one integer kk — the number of points that don't belong to any segment.
In the second line print exactly kk integers in any order — the points that don't belong to any segment. All points you print should be distinct.
If there are no such points at all, print a single integer 00 in the first line and either leave the second line empty or do not print it at all.
Examples
input
Copy

3 5
2 2
1 2
5 5

output
Copy

2
3 4 

input
Copy

1 7
1 7

output
Copy

0

Note
In the first example the point 11 belongs to the second segment, the point 22 belongs to the first and the second segments and the point 55belongs to the third segment. The points 33 and 44 do not belong to any segment.
In the second example all the points from 11 to 77 belong to the first segment.
 
제목에 따라 폭력을 갱신하면 된다.

#include
#define mp make_pair
#define fir first
#define se second
#define ll long long
#define pb push_back
using namespace std;
const int maxn=2e5+10;
const ll mod=1e9+7;
const int maxm=1e6+10;
const double eps=1e-7;
const int inf=0x3f3f3f3f;
const double pi = acos (-1.0);
int n,m;
int vis[maxn];

int main(){
    cin>>n>>m;
    for (int i=1;i<=n;i++){
        int l,r;
        cin>>l>>r;
        for (int j=l;j<=r;j++)
            vis[j]=1;
    }
    int num=0;
    for (int i=1;i<=m;i++)
        num+=(vis[i]==0);
    cout<