Submission #50598

#TimeUsernameProblemLanguageResultExecution timeMemory
50598XmtosXSan (COCI17_san)C++17
48 / 120
1090 ms544 KiB
#include <bits/stdc++.h>
using namespace std;
int n;
long long c[50],h[50],k;
long long bt(int pos,long long last,long long sum)
{
    if (pos==n)
        return (sum>=k);
    long long ans=0;
    if (h[pos]>=last)
        ans=bt(pos+1,h[pos],sum+c[pos]);
    ans+=bt(pos+1,last,sum);
    return ans;
}
int main()
{
    cin >>n>>k;
    for (int i=0;i<n;i++)
        cin >>h[i]>>c[i];
    cout << bt(0,0,0);
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...