Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int n;
- int k[101];
- int ans = INT_MAX;
- int main(){
- //freopen("kayak.in", "r", stdin);
- cin >> n;
- int size = n*2;
- for(int i=0; i<size; i++){
- cin >> k[i];
- }
- sort(k, k+size);
- for(int i=0; i<size; i++){
- for(int j=i+1; j<size; j++){
- int l=0, r=1;
- int temp = 0;
- while(l<r && r<size){
- while(l==i || l==j){
- l++;
- }
- while(r==i || r==j || r==l){
- r++;
- }
- if(l>=size || r>=size) break;
- temp+=k[r]-k[l];
- l+=2;
- r+=2;
- }
- ans = min(ans, temp);
- }
- }
- cout << ans << '\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
