Diferente pentru problema/minperm intre reviziile #7 si #6
Nu exista diferente intre titluri.
Diferente intre continut:
h2. Date de intrare
The first line of the input file $minperm.in$ contains $n$ and $k$. The second line of the input contains $n$ integers, representing the initial order of the attractions. The third line of the input contains $k$ integers, representing the $k$ available swap plans.
Fişierul de intrare $minperm.in$ ...
h2. Date de ieşire
