Minimum Cost - study code - HackerRank - woman codesprint - study code - close to my idea

minimumCost_studycode_c1.cpp

// C++11
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int n;
    cin >> n;
    vector<long long> p(n);
    for (int i = 0; i < n; ++i)
        cin >> p[i];
    long long mn = -1;
    vector<pair<long long, int> > po;
    for (int i = 0; i < n; ++i)
        po.push_back(make_pair(p[i], i));
    sort(po.begin(), po.end());
    for (int i = 0; i < n; ++i) {
        int j;
        for (j = i + 1; j < n && po[j].second >= po[i].second; ++j);
        if (j < n && (mn == -1 || mn > po[j].first - po[i].first))
            mn = po[j].first - po[i].first;
    }
    cout << mn << endl;
    return 0;
}