chenchen题解：CSP-J 2019题解

下面是关于CSP-J 2019的错题整理：

#include<cstdio>
using namespace std;
int n, m;
int a[100], b[100];

int main() {
   
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i)
        a[i] = b[i] = 0;
    for (int i = 1; i <= m; ++i) {
   
        int x, y;
        scanf("%d%d", &x, &y);
        if (a[x] < y && b[y] < x) {
   
            if (a[x] > 0)
                b[a[x]