#include <iostream>
#include <algorithm>
#include <iterator>


int main(){

        int totalGangsters = 10;
        int distances[totalGangsters];

        // Ide?
        // Distance sum
        for(int i = 0; i < totalGangsters; i++){

            distances[i] = 0;
        }

        // Rendezés növekvő sorrendben
        int minimumIndex;
        for(int i = 0, n = std::end(distances) - std::begin(distances); i < n; i++ ){
            minimumIndex = std::min_element(distances + i, distances+totalGangsters) - std::begin(distances);
            std::swap(distances[minimumIndex], distances[i]);
            //std::swap(gngstrs[minimumIndex], gngstrs[i]);
        }

  return 0;

}