Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- using namespace std;
- int compare(int a, int b)
- { return a < b; }
- int main( )
- {
- int n;
- cin >> n;
- int g[n];
- for (int i = 0; i < n; ++i)
- {
- cin >> g[i];
- }
- sort(g, g + n, compare);
- int gv[n];
- gv[0] = gv[1] = g[1] - g[0];
- for (int i = 2; i < n; ++i)
- {
- gv[i] = min(gv[i - 1], gv[i - 2]) + g[i] - g[i - 1];
- }
- cout << gv[n-1];
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement