#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
    int n,m;
    cin>>n>>m;
    vector<int>lmt(n);
    for(int i=0;i<n;i++){
        cin>>lmt[i];
    }
    vector<int>s(m);
    for (int i=0;i<m;i++){
        cin>>s[i];
    }
    sort(lmt.begin(),lmt.end());
	sort(s.begin(),s.end());

    int cost=0;
    int hour=0;
    int cake=0;
    int Lmt=lmt[0];
    while(hour<n){
        while(cake<m&&s[cake]<hour){
            cake++;
        }
        if(cake==m){
            cost++;
            Lmt=lmt[hour];
            hour++;
        }
		else{
            if(Lmt<=0){
                hour++;
                Lmt=lmt[hour];
            }
			else{
                s[cake]+=8;
                Lmt--;
            }
        }
    }
    cout<<cost;
    return 0;
}

如题，输完 n,m 后会输出一个数，这是怎么回事/kel