-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2473.cpp
43 lines (39 loc) · 951 Bytes
/
2473.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
#include <bits/stdc++.h>
using namespace std;
int n;
long long ans[3], arr[5001];
int main (){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for(int i = 0; i < n; i++){
cin >> arr[i];
}
sort(arr, arr+n);
long long minv = 3987654321;
for(int i = 0; i < n-2; i ++){
int l = i+1, r = n-1;
while(l<r){
long long sumv = arr[i] + arr[l] + arr[r];
if(abs(minv) > abs(sumv)){
ans[0] = arr[i];
ans[1] = arr[l];
ans[2] = arr[r];
minv = sumv;
}
if(sumv > 0) r--;
else if (sumv < 0) l++;
else{
for(int i = 0; i < 3; i++){
cout << ans[i] << ' ';
}
return 0;
}
}
}
for(int i = 0; i < 3; i++){
cout << ans[i] << ' ';
}
return 0;
}