#include "GridSortMax.cpp" int main(int argc, char **argv) { class GridSortMax TheClass; string retval; int n; int m; vector grid; if (argc != 2) { fprintf(stderr, "usage: a.out num\n"); exit(1); } if (atoi(argv[1]) == 0) { n = 2; m = 2; grid.push_back(1); grid.push_back(2); grid.push_back(3); grid.push_back(4); } if (atoi(argv[1]) == 1) { n = 2; m = 2; grid.push_back(2); grid.push_back(1); grid.push_back(3); grid.push_back(4); } if (atoi(argv[1]) == 2) { n = 2; m = 2; grid.push_back(4); grid.push_back(2); grid.push_back(3); grid.push_back(1); } if (atoi(argv[1]) == 3) { n = 1; m = 10; grid.push_back(10); grid.push_back(6); grid.push_back(2); grid.push_back(3); grid.push_back(5); grid.push_back(7); grid.push_back(1); grid.push_back(9); grid.push_back(4); grid.push_back(8); } if (atoi(argv[1]) == 4) { n = 3; m = 5; grid.push_back(5); grid.push_back(2); grid.push_back(10); grid.push_back(7); grid.push_back(9); grid.push_back(3); grid.push_back(4); grid.push_back(14); grid.push_back(11); grid.push_back(1); grid.push_back(15); grid.push_back(12); grid.push_back(6); grid.push_back(8); grid.push_back(13); } if (atoi(argv[1]) == 5) { n = 6; m = 2; grid.push_back(3); grid.push_back(9); grid.push_back(5); grid.push_back(1); grid.push_back(10); grid.push_back(6); grid.push_back(2); grid.push_back(7); grid.push_back(8); grid.push_back(11); grid.push_back(12); grid.push_back(4); } retval = TheClass.findMax(n, m, grid); cout << retval << endl; }