Easy & Clear Solution (99%) C++
\nclass Solution {\npublic:\n    int largestPerimeter(vector<int>& A) {\n        ios::sync_with_stdio(0); cout.tie(0); cin.tie(0);\n        sort(A.begin(),A.end
```\nclass Solution {\npublic:\n    int largestPerimeter(vector<int>& A) {\n        ios::sync_with_stdio(0); cout.tie(0); cin.tie(0);\n        sort(A.begin(),A.end());\n        int n=A.size();\n        for(int i=n-1;i>1;i--){\n            if(A[i]>=A[i-1]+A[i-2])continue;\n            else return A[i]+A[i-1]+A[i-2];\n        }\n        return 0;\n    }\n};\n```
['C', 'C++']