星际争霸II 战斗问题

#include <iostream>

using namespace std;

int main()
{
        int n;
        int k;
        int m;
        int l;
        int x;
        
        cin >> n >> k >> l >> m >> x;
            
        int marine = x;
        int zerg1 = m;
        int zerg2 = m;
        int distance = n;
    
        while(marine > 0 && (zerg1 > 0 || zerg2 > 0)) 
        {
            if(distance && zerg1 > 0) {
                distance--;
                zerg1 -= l;
            } else if(distance && zerg1 <= 0 && zerg2 > 0) {
                distance--;
                zerg2 -= l;
            }else if(zerg1 > 0) {
                zerg1 -= l;
                marine -= k * 2;
            } else {
                zerg2 -= l;
                marine -= k;
            }
        }
    
        if(marine > 0) cout << "Marine Win!" << endl;
        else cout << "Zergling Win!" << endl;
    
    return 0;
}