#include #include #include #include using namespace std; //convert our string to list array. Only spaces between digits allowed. list* stringToListInt(string str) { list* arrayV = new list; do { auto cutPosition = str.find(' ', 0); if (cutPosition == str.npos)cutPosition = str.length(); // delete before first element spaces if (str.front() == ' ') {str.erase(0); continue;} //delete after last element spaces if(str.back() == ' '){str.pop_back(); continue; } //delete double and more spaces bettween numbers if(cutPosition!=str.npos) if(str[cutPosition]==' ' && str[cutPosition+1] == ' ') { str.erase(cutPosition, cutPosition); continue; } //cout << cutPosition << " -- " << str.length()<<" -- " << str << endl; arrayV->push_back(stoi(str.substr(0, cutPosition))); if ((str.length() - cutPosition) > 0) str = str.substr(cutPosition + 1, str.length() - cutPosition); else break; } while (true); return arrayV; } int main() { //input data cout << "Enter numbers over space" << endl; string str; getline(cin, str); cout<* A; A = stringToListInt(str); //algorithm A->sort(std::greater()); int big,small; int Asize=A->size(); int B[Asize]; int it=1, left=0, right=Asize-1; //actually not proven that it works correctly, but simple, intuitively, low cost alghorithm :) //step by step biggest and smallest numbers place closely to minimize production and do it in two way from right snd left side of array to center in four takts by it. [1 2[]4 3]=>[1 2[1 2 4 3]4 3]=>.. do{ big=A->front(); small=A->back(); if(it==4){B[right]=small; A->pop_back(); it=1; right--;} else if(it==3){B[right]=big; A->pop_front(); it++; right--;} else if(it==2){B[left]=small; A->pop_back(); it++; left++;} else if(it==1) {B[left]=big; A->pop_front(); it++; left++;} }while(left<=right); cout<

Minimal Pairs Product Sum