Scribd Logo
Upload

Welcome to Scribd!

  • 8 views

    5

    Uploaded by

    23020676
    5

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd

    5

    Uploaded by

    23020676
    8 views2 pages
    5

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    5

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    8 views2 pages

    5

    Uploaded by

    23020676
    5

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    of 2

    #include <bits/stdc++.

    h>

    using namespace std;

    string ltrim(const string &);


    string rtrim(const string &);
    vector<string> split(const string &);

    /*
    * Complete the 'closestNumbers' function below.
    *
    * The function is expected to return an INTEGER_ARRAY.
    * The function accepts INTEGER_ARRAY arr as parameter.
    */

    vector<int> closestNumbers(vector<int> arr) {


    sort(arr.begin(), arr.end());
    long long sub = LLONG_MAX;
    vector<int> result;
    for (int i = 0; i < arr.size() - 1; i++)
    {
    long long temp = arr[i+1] - arr[i];
    if (temp < sub)
    {
    sub = temp;
    result.clear();
    result.push_back(arr[i]);
    result.push_back(arr[i+1 ]);
    }
    else if (temp == sub)
    {
    result.push_back(arr[i]);
    result.push_back(arr[i+1 ]);
    }
    }
    return result;
    }

    int main()
    {
    ofstream fout(getenv("OUTPUT_PATH"));

    string n_temp;
    getline(cin, n_temp);

    int n = stoi(ltrim(rtrim(n_temp)));

    string arr_temp_temp;
    getline(cin, arr_temp_temp);

    vector<string> arr_temp = split(rtrim(arr_temp_temp));

    vector<int> arr(n);

    for (int i = 0; i < n; i++) {


    int arr_item = stoi(arr_temp[i]);

    arr[i] = arr_item;
    }
    vector<int> result = closestNumbers(arr);

    for (size_t i = 0; i < result.size(); i++) {


    fout << result[i];

    if (i != result.size() - 1) {
    fout << " ";
    }
    }

    fout << "\n";

    fout.close();

    return 0;
    }

    string ltrim(const string &str) {


    string s(str);

    s.erase(
    s.begin(),
    find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
    );

    return s;
    }

    string rtrim(const string &str) {


    string s(str);

    s.erase(
    find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
    s.end()
    );

    return s;
    }

    vector<string> split(const string &str) {


    vector<string> tokens;

    string::size_type start = 0;
    string::size_type end = 0;

    while ((end = str.find(" ", start)) != string::npos) {


    tokens.push_back(str.substr(start, end - start));

    start = end + 1;
    }

    tokens.push_back(str.substr(start));

    return tokens;
    }

    You might also like