Submission #521473

#TimeUsernameProblemLanguageResultExecution timeMemory
521473Rasoul006San (COCI17_san)C++17
48 / 120
1073 ms320 KiB
#include <bits/stdc++.h> #define endl "\n" typedef long long ll; using namespace std; const int N = 1e6+5; const int mod = 1e9+7; ll a[200009] , b[200009] , n , k ; int main() { ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin >> n >> k ; for(int i = 0 ; i < n ;i++){ cin >> a[i] >> b[i] ; } ll ans = 0 ; for(int i = 0 ; i < (1ll << n) ; i++){ ll mx = 0 ; ll cur = 0 ; // cout << i << endl ; for(int j = 0 ; j < n ; j++){ if((i & (1ll << j))){ if(a[j] >= mx){ // cout << j << " " ; cur += b[j] ; } else{ cur = -1e18 ; } mx = max(a[j] , mx) ; } } // cout << endl ; // cout << cur << endl ; if(cur >= k){ ans ++ ; } } cout << ans << endl ; 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...