1ThePianist

function solve(input){

    let n= Number(input.shift());

    let Allpieces={};
    for (let i = 0; i < n; i++) {
       const[piece,composer,key]= input.shift().split('|');
        Allpieces[piece]={composer,key};
    }

    let cmd= input.shift();

    while(cmd !='Stop'){

        let ArrCmd= cmd.split('|');
        let piece=ArrCmd[1];

        switch(ArrCmd[0]){
            case'Add':
            let composer=ArrCmd[2];
            let key=ArrCmd[3];
            if(!Allpieces[piece]){

                Allpieces[piece]={composer,key};
                console.log(`${piece} by ${composer} in ${key} added to the collection!`)
            }
            else{
                console.log(`${piece} is already in the collection!`)
            }

            break;

            case'Remove':
            if(Allpieces[piece]){

                delete Allpieces[piece];
                console.log(`Successfully removed ${piece}!`)
            }
            else{
                console.log(`Invalid operation! ${piece} does not exist in the collection.`)

            }
            break;

            case'ChangeKey':
            let newkey=ArrCmd[2];
            if(Allpieces[piece]){
                   Allpieces[piece].key= newkey;
                   console.log(`Changed the key of ${piece} to ${newkey}!`)
            }
            else{
            console.log(`Invalid operation! ${piece} does not exist in the collection.`);
            }
            break;

        }

        cmd= input.shift();
    }

    let NewPieces= Object.entries(Allpieces);


 // NewPieces.sort((a,b) => a[0].localeCompare(b[0]));

    //(a,b)=> b.level- a.level);

    for (const piece of NewPieces) {

        console.log(`${piece[0]} -> Composer: ${piece[1].composer}, Key: ${piece[1].key}`)
    }



}