-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathsticky.cpp
55 lines (45 loc) · 825 Bytes
/
sticky.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
//Solved by https://open.kattis.com/users/vedang-gaonkar
#define _USE_MATH_DEFINES
#include <iostream>
#include <stdio.h>
#include <cmath>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <ctype.h>
#include <queue>
#include <map>
#include <set>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main()
{
ll i, j, k;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
vector<ull> a;
int n;
cin>>n;
for(int i=0; i<n; i++)
{
ull x;
cin>>x;
a.push_back(x);
}
sort(a.begin(), a.end());
for(int i=0; i<n-2; i++)
{
if(a[i] + a[i+1] > a[i+2])
{
cout<<"possible"<<endl;
return 0;
}
}
cout<<"impossible"<<endl;
return 0;
}