Language: C++

/******Author : c0d3rpr0********/
#include <bits/stdc++.h>
using namespace std;
const auto start_time = std::chrono::high_resolution_clock::now();
typedef unsigned long long ull;
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef long double ld;
typedef set<ll>::iterator sit;
typedef map<ll,ll>::iterator mit;
typedef vector<ll>::iterator vit;
const ll INF = 1LL<<18;
const ll MOD = 1e9 + 7;
const ll EPS = 1e-6;
#define each(it,s) for(vit it = s.begin(); it != s.end(); ++it)
#define sortA(v) sort(v.begin(), v.end())
#define sortD(v) sort(v.begin(), v.end(), greater<ll>())
#define fill(a) memset(a, 0, sizeof (a))
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define repA(i, a, n) for(ll i = a; i < (n); ++i)
#define repD(i, a, n) for(ll i = a; i >= (n); --i)
#define pq(x) priority_queue<x,std::vector<x>,compare>
#define rpq(x) priority_queue<x,std::vector<x>,compare>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define vin(a,n) vll a;rep(i,n){ll in;cin>>in;a.pb(in);}
#define arrin(arr,n) rep(i,n){cin>>arr[i];}
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ignore cin.ignore(256,'\n');
ll gcd(ll x,ll y) {if(x==0) return y;return gcd(y%x,x);}
ll powM(ll x,ll y,ll m) {ll ans=1,r=1;x%=m;while(r>0&&r<=y){if(r&y){ans*=x;ans%=m;}r<<=1;x*=x;x%=m;}return ans;}
ll modI(ll a, ll m) {ll m0=m,y=0,x=1;if(m==1) return 0;while(a>1){ll q=a/m;ll t=m;m=a%m;a=t;t=y;y=x-q*y;x=t;}if(x<0) x+=m0;return x;}
ll max(ll a,ll b,ll c) {return max(max(a,b),c);}
ll power(ll x,ll y) {ll z=1;while(y>0){if(y%2)z=(z*x);x =(x*x) ;y/=2;}return z;}
void solve()
{
}
int main()
{
fastio;
#ifndef ONLINE_JUDGE
freopen("/home/naman/Desktop/CP/input.txt","r",stdin);
freopen("/home/naman/Desktop/CP/output.txt","w",stdout);
#endif
ll t;
cin>>t;
while(t--)
{
solve();
}
auto end_time = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> diff = end_time - start_time;
#ifndef ONLINE_JUDGE
cerr << "Time Taken : " << diff.count() << "s\n";
#endif
}
© 2020 GitHub, Inc./******Author : c0d3rpr0********/
#include <bits/stdc++.h>
using namespace std;
const auto start_time = std::chrono::high_resolution_clock::now();
typedef unsigned long long ull;
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef long double ld;
typedef set<ll>::iterator sit;
typedef map<ll,ll>::iterator mit;
typedef vector<ll>::iterator vit;
const ll INF = 1LL<<18;
const ll MOD = 1e9 + 7;
const ll EPS = 1e-6;
#define each(it,s) for(vit it = s.begin(); it != s.end(); ++it)
#define sortA(v) sort(v.begin(), v.end())
#define sortD(v) sort(v.begin(), v.end(), greater<ll>())
#define fill(a) memset(a, 0, sizeof (a))
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define repA(i, a, n) for(ll i = a; i < (n); ++i)
#define repD(i, a, n) for(ll i = a; i >= (n); --i)
#define pq(x) priority_queue<x,std::vector<x>,compare>
#define rpq(x) priority_queue<x,std::vector<x>,compare>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define vin(a,n) vll a;rep(i,n){ll in;cin>>in;a.pb(in);}
#define arrin(arr,n) rep(i,n){cin>>arr[i];}
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ignore cin.ignore(256,'\n');
ll gcd(ll x,ll y) {if(x==0) return y;return gcd(y%x,x);}
ll powM(ll x,ll y,ll m) {ll ans=1,r=1;x%=m;while(r>0&&r<=y){if(r&y){ans*=x;ans%=m;}r<<=1;x*=x;x%=m;}return ans;}
ll modI(ll a, ll m) {ll m0=m,y=0,x=1;if(m==1) return 0;while(a>1){ll q=a/m;ll t=m;m=a%m;a=t;t=y;y=x-q*y;x=t;}if(x<0) x+=m0;return x;}
ll max(ll a,ll b,ll c) {return max(max(a,b),c);}
ll power(ll x,ll y) {ll z=1;while(y>0){if(y%2)z=(z*x);x =(x*x) ;y/=2;}return z;}
void solve()
{
    int a,b,c,k;
    cin>>a>>b>>c>>k;
    int ans=0;
    if(k>=a) {ans+=a;
    k-=a;}
    else{
        ans = k;
        cout<<ans;
        return;
    }
    if(k>=b) k-=b;
    else
    {
        cout<<ans;
        return;
    }
    ans-=k;
    cout<<ans;
    return;
}
int main()
{
fastio;
/*#ifndef ONLINE_JUDGE
freopen("/home/naman/Desktop/CP/input.txt","r",stdin);
freopen("/home/naman/Desktop/CP/output.txt","w",stdout);
#endif*/
ll t=1;
//cin>>t;
while(t--)
{
solve();
}
auto end_time = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> diff = end_time - start_time;
/*#ifndef ONLINE_JUDGE
cerr << "Time Taken : " << diff.count() << "s\n";
#endif*/
}

Compiler output:
a.cc:63:1: error: extended character © is not valid in an identifier
   63 | © 2020 GitHub, Inc./******Author : c0d3rpr0********/
      | ^
a.cc:63:1: error: '\U000000a9' does not name a type
   63 | © 2020 GitHub, Inc./******Author : c0d3rpr0********/
      | ^
a.cc:66:12: error: conflicting declaration 'const auto start_time'
   66 | const auto start_time = std::chrono::high_resolution_clock::now();
      |            ^~~~~~~~~~
a.cc:4:12: note: previous declaration as 'const std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long int, std::ratio<1, 1000000000> > > start_time'
    4 | const auto start_time = std::chrono::high_resolution_clock::now();
      |            ^~~~~~~~~~
a.cc:78:10: error: redefinition of 'const ll INF'
   78 | const ll INF = 1LL<<18;
      |          ^~~
a.cc:16:10: note: 'const ll INF' previously defined here
   16 | const ll INF = 1LL<<18;
      |          ^~~
a.cc:79:10: error: redefinition of 'const ll MOD'
   79 | const ll MOD = 1e9 + 7;
      |          ^~~
a.cc:17:10: note: 'const ll MOD' previously defined here
   17 | const ll MOD = 1e9 + 7;
      |          ^~~
a.cc:80:10: error: redefinition of 'const ll EPS'
   80 | const ll EPS = 1e-6;
      |          ^~~
a.cc:18:10: note: 'const ll EPS' previously defined here
   18 | const ll EPS = 1e-6;
      |          ^~~
a.cc:98:4: error: redefinition of 'll gcd(ll, ll)'
   98 | ll gcd(ll x,ll y) {if(x==0) return y;return gcd(y%x,x);}
      |    ^~~
a.cc:36:4: note: 'll gcd(ll, ll)' previously defined here
   36 | ll gcd(ll x,ll y) {if(x==0) return y;return gcd(y%x,x);}
      |    ^~~
a.cc:99:4: error: redefinition of 'll powM(ll, ll, ll)'
   99 | ll powM(ll x,ll y,ll m) {ll ans=1,r=1;x%=m;while(r>0&&r<=y){if(r&y){ans*=x;ans%=m;}r<<=1;x*=x;x%=m;}return ans;}
      |    ^~~~
a.cc:37:4: note: 'll powM(ll, ll, ll)' previously defined here
   37 | ll powM(ll x,ll y,ll m) {ll ans=1,r=1;x%=m;while(r>0&&r<=y){if(r&y){ans*=x;ans%=m;}r<<=1;x*=x;x%=m;}return ans;}
      |    ^~~~
a.cc:100:4: error: redefinition of 'll modI(ll, ll)'
  100 | ll modI(ll a, ll m) {ll m0=m,y=0,x=1;if(m==1) return 0;while(a>1){ll q=a/m;ll t=m;m=a%m;a=t;t=y;y=x-q*y;x=t;}if(x<0) x+=m0;return x;}
      |    ^~~~
a.cc:38:4: note: 'll modI(ll, ll)' previously defined here
   38 | ll modI(ll a, ll m) {ll m0=m,y=0,x=1;if(m==1) return 0;while(a>1){ll q=a/m;ll t=m;m=a%m;a=t;t=y;y=x-q*y;x=t;}if(x<0) x+=m0;return x;}
      |    ^~~~
a.cc:101:4: error: redefinition of 'll max(ll, ll, ll)'
  101 | ll max(ll a,ll b,ll c) {return max(max(a,b),c);}
      |    ^~~
a.cc:39:4: note: 'll max(ll, ll, ll)' previously defined here
   39 | ll max(ll a,ll b,ll c) {return max(max(a,b),c);}
      |    ^~~
a.cc:102:4: error: redefinition of 'll power(ll, ll)'
  102 | ll power(ll x,ll y) {ll z=1;while(y>0){if(y%2)z=(z*x);x =(x*x) ;y/=2;}return z;}
      |    ^~~~~
a.cc:40:4: note: 'll power(ll, ll)' previously defined here
   40 | ll power(ll x,ll y) {ll z=1;while(y>0){if(y%2)z=(z*x);x =(x*x) ;y/=2;}return z;}
      |    ^~~~~
a.cc:103:6: error: redefinition of 'void solve()'
  103 | void solve()
      |      ^~~~~
a.cc:41:6: note: 'void solve()' previously defined here
   41 | void solve()
      |      ^~~~~
a.cc:125:5: error: redefinition of 'int main()'
  125 | int main()
      |     ^~~~
a.cc:44:5: note: 'int main()' previously defined here
   44 | int main()
      |     ^~~~