[codility]Triangle

// you can also use includes, for example:
// #include <algorithm>
#include<algorithm>
int solution(const vector<int> &A) {
    // write your code in C++98
    if(A.size() < 3) return 0;
    vector<int> sortedEdge = A;
    //...sort first 
    sort(sortedEdge.begin(), sortedEdge.end());
    //...if exists A[P]+A[R]>A[Q] then exists A[R-1]+A[R]>A[R+1] 
    for(int P = 0; P < sortedEdge.size()-2; ++P)
    {
        if((long long)sortedEdge[P]+(long long)sortedEdge[P+1] > (long long)sortedEdge[P+2]) return 1;
    }
    //...return result
    return 0;
}