Codeforces Round 831 Div1+2|C. Bricks and Bags||code+Explanation

[@EngineerPrabhatSingh]

solution for this problem.......... #include using namespace std; #define int long long int signed main(){ int t; cin>>t; while ( t--) { int n; cin>>n; vectorv(n); for ( int i = 0; i < n; i++) { cin>>v[i]; } sort(v.begin(),v.end()); int ans=0; for ( int i = 0; i =2; i--) { ans=max(ans,v[i]-v[i-1]+v[i]-v[0]); } cout

[@psurya3053]

thanks paaji , tusi great ho

[@EngineerPrabhatSingh]

Thanks Bhai. Support the channel.

[@xolo2617]

thanks sir , i was get logic from one side but never thought of to run from opposite side and now my solution(java) got accepted

[@EngineerPrabhatSingh]

Thanks

[@Negijicoder]

maine bhi same logic lagaya tha jo phle btaya..😂😂😂😂 (kya kru hote hi nahi questions...1400 ke ab tak 60+ kr liye fir bhi atak hi jata hu..)

[@ayyappaswamy8220]

In the first example if we pick bricks whose weights are 1 5 2 the answer would be 7 which is greater than 6. Why shouldn't we pick 1 5 2

[@unibrow9384]

Ur CF handle?

[@EngineerPrabhatSingh]

prabhatsingh12