Given an unsorted LaTeX: \texttt{vector} vector and a number LaTeX: n n , what is the worst-case time complexity for finding the pair of integers whose sum is closest to LaTeX: n n , if you are not allowed to use any additional memory? For example, if you were given the vector LaTeX: \{12, 3, 17, 5, 7\} { 12 , 3 , 17 , 5 , 7 } and LaTeX: n = 13 n = 13 , you would return the pair LaTeX: \{5, 7\} { 5 , 7 } .

Print "censored" if userinput contains the word "darn", else print userinput. end with newline. ex: if userinput is "that darn cat.", then output is: censoredex: if userinput is "dang, that was scary! ", then output is: dang, that was scary! note: if the submitted code has an out-of-range access, the system will stop running the code after a few seconds, and report "program end never reached." the system doesn't print the test case that caused the reported message.#include #include using namespace std; int main() {string userinput; getline(cin, userinput); int ispresent = userinput.find("darn"); if (ispresent > 0){cout < < "censored" < < endl; /* your solution goes here */return 0; }