Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
Sort row sorted matrix
//Title of this code //g++ 4.8.2 #include <iostream> #include <string> #include <vector> std::vector<int> sortMatrix(std::vector<std::vector<int>>& matrix) { std::vector<int> sorted; std::vector<int> positions(matrix.size()); for (int i = 0; i < matrix.size(); ++i) positions[i] = 0; int pos = 0; while (pos != -1) { int min = 9999; pos = -1; for (int i = 0; i < matrix.size(); ++i) { if (positions[i] < matrix[i].size() && matrix[i][positions[i]] < min) { min = matrix[i][positions[i]]; pos = i; } } if (pos != -1) { sorted.push_back(min); ++positions[pos]; } } return sorted; } int main() { std::cout << "Hello, world!\n"; std::vector<std::vector<int>> matrix = {{1,2,3},{1,4,5},{1,3,7}}; std::vector<int> sorted; sorted = sortMatrix(matrix); for (int i = 0; i < sorted.size(); ++i) std::cout << sorted[i] << " "; std::cout << std::endl; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
OTHER - Two robots
Game
Sequence point and array
Count of factors
temporaries and move constructor
Caminho das Pontes
lambda demo
задача new
Print Euler Path
Nieparzyste w macierzy
stackse - search stackoverflow differently
Please log in to post a comment.