奶牛蓄栏问题 贪心法

#include<iostream>  
using namespace std;
int init(int x, int y);
int a[2][50];
int b[50][100];
int  m[50];
int main() {
    int n;
    m[0] = 0;
    int count = 1;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[0][i] >>a[1][i];
    }
    int s;
    b[0][0] = a[0][0];
    b[0][1] = a[1][0];
    for (int j = 1; j < n; j++) {
        for (int i = 0; i < count;i++) {
            if (init(i, j) == 1) {
                m[j] = i;
                s = 1;
                break;
            }
            else s = 0;
        }
        if (s == 0) {
            b[count][0] = a[0][j];
            b[count][1] = a[1][j];
            m[j] = count;
            count++;
        }
    }
    cout << count << endl;
    for (int i = 0; i < n; i++) {
        cout << m[i] + 1<