Educational Codeforces Round 130 (Rated for Div. 2) 1697A. Parkway Walk Solution

   




Solution in C++:

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include <iostream>
using namespace std;
int main()
{
    int t,i;
    cin>>t;
    while(t--)
    {
        int n,m,s,x;
        s=0;
        cin>>n>>m;
        while(n--)
        {
         cin>>x;
         s+=x;
        }
        if(s<=m)
        cout<<"0"<<endl;
        else{
            cout<<s-m<<endl;
        }

    }
}
 





No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.