-
Notifications
You must be signed in to change notification settings - Fork 0
/
2_8.cpp
86 lines (66 loc) · 1.64 KB
/
2_8.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MAXSIZE 10000000;
const int MAX = 510000;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
ll dp[10001][1001] ={ 0 };
int main()
{
int N;
int l[30][2] ={ 0 };
cin >>N;
for (int i = 0; i < N; i++) {
cin >>l[i][0]>>l[i][1];
}
ll ans = INF;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
int s = l[i][0];
int o = l[j][1];
ll tmpSum = 0;
for (int k = 0; k < N; k++) {
tmpSum += abs(l[k][0] - s) + abs(l[k][0] - l[k][1]) + abs(l[k][1] - o);
}
ans = min(ans, tmpSum);
}
}
cout <<ans<<endl;
}
/*Syakutori
while(cin >>b && b)){
ll t = 1;
long long int ansS = 1,ansT=0;
long long int sum = 0;
for(ll s = 1;s < 50000000;s++){
while(t < 50000000 && sum+Rsum[t] < b){
sum += Rsum[t];
t++;
}
if(b == sum+Rsum[t]){
if(ansT - ansS < t-s){
ansS = s;
ansT = t;
}
cout <<ansS<<" "<<ansT-ansS + 1<<endl;
break;
}
if(t == s)++t;
else sum -= Rsum[s];
}
}
//priority_queue<long long int,vector<long long int>, greater<long long int>> PQ;
//priority_queue<long long int> PQ1;
bool comp(const pair<int,int> a, const pair<int,int> b) {
return a.second < b.second;
}
ll gcd(ll a,ll b){
if(a%b == 0){
return b;
}else{
return gcd(b,a%b);
}
}
*/