B

Begin: 2021-06-13 08:30 BST
Inverse.AI Weekly Contest 123
End: 2021-06-20 06:00 BST
03:55:01
Elapsed: 03:55:02RunningRemaining: 161:34:57
Overview
Problem
Status
Rank (03:54:56)
0 Comments
Previous12345…Next
Username
Prob

All
Result

All
Time
(ms)	Mem
(MB)	Lang

All
Submit Time
Fahim_7861
C
Accepted
31	1
C++
3 hr ago
Fahim_7861
B
Accepted
31	0
C++
4 hr ago
Fahim_7861
A
Accepted
15
C++
4 hr ago

All Copyright Reserved © 2010-2021 Xu Han
Server Time: 2021-06-13 12:25:02 BST

#31379402 | Fahim_7861's solution for [Problem B]
Status
Accepted
Time
31ms
Memory
8kB
Length
1952
Lang
GNU G++17 7.3.0
Submitted
2021-06-13 08:51:19
Shared

Select Code
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c)   min(a, min(b, c))
#define max3(a, b, c)   max(a, max(b, c))
#define sf(a) scanf("%d",&a)
#define pf(a) printf("%d",a);
#define F first
#define S second
#define in  freopen("input.txt", "r", stdin)
#define out  freopen("output.txt", "w", stdout)
#define minheap int,vector<int>,greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x)  (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) ((ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')||(ch=='A'|| ch=='E' || ch=='I'|| ch=='O'|| ch=='U'))
#define bug cout<<"BUG"<<endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI  =3.141592653589793238463;
bool compare(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
       return (a.first > b.first);
}
ll lcm(ll a,ll b)
{
    if(a==0 || b==0)return 0;

    return a/__gcd(a,b)*b;
}

void input(ll ara[],ll n)
{
    for(ll i=0; i<n; i++)cin>>ara[i];
}
void print(ll ara[],ll n)
{
    for(ll i=0; i<n; i++)
        cout<<ara[i]<<" ";
    cout<<endl;
}


int main()
{

   fastread();

   ll i,j,n,m,p,a,sum=0,k,t,b,c,d,cnt=0,q,l,r,ans=0;

      bool flag=false;

      string str;

ll k1,k2;

      cin>>a>>b>>k1>>k2>>n;

      sum=( (k1-1)*a)+((k2-1)*b);

      ll mi=0,mx=0;


      if(sum<n)
      {
          mi=n-sum;

          mi=min(a+b,mi);
      }

      if(k1>k2)
      {
          swap(a,b);
          swap(k1,k2);
      }

      ll nawaJabe = n/k1;


      nawaJabe=min(a,nawaJabe);

      n-=(nawaJabe*k1);

       ll nawaJabe2 = n/k2;




      nawaJabe2=min(b,nawaJabe2);



      n-=(nawaJabe2*k2);


      cout<<mi<<" "<<nawaJabe+nawaJabe2<<endl;






      return 0;


}