Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- #include <fstream>
- using namespace std;
- ifstream fin("bridge.in");
- ofstream fout("bridge.out");
- void quickSort(int arr[], int left, int right) {
- int i = left, j = right;
- int tmp;
- int pivot = arr[(left + right) / 2];
- /* разделение */
- while (i <= j) {
- while (arr[i] < pivot)
- i++;
- while (arr[j] > pivot)
- j--;
- if (i <= j) {
- tmp = arr[i];
- arr[i] = arr[j];
- arr[j] = tmp;
- i++;
- j--;
- }
- };
- /* рекурсия */
- if (left < j)
- quickSort(arr, left, j);
- if (i < right)
- quickSort(arr, i, right);
- }
- int main()
- {
- int n;
- cin >> n;
- int* passer = new int[n];
- for (long long i = 0; i < n; i++)
- {
- cin >> passer[i];
- }
- quickSort(passer, 0, n - 1);
- for (int i = 2; i < n; i++)
- {
- passer[i] += min(passer[i - 1] + passer[0], passer[i - 2] + passer[0] + 2 * passer[1]);
- }
- cout << passer[n - 1] << endl;
- delete[] passer;
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement