fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long
  4. #define vi vector<int>
  5. #define fi first
  6. #define se second
  7. #define pb push_back
  8. #define ii pair<int , int>
  9. #define pq priority_queue
  10. #define iii pair<int , pair<int , int>>
  11. #define fo(i,l,r) for(int i=l;i<=r;i++)
  12. #define fod(i,r,l) for(int i=r;i>=l;i--)
  13. #define fill(f,x) memset(f,x,sizeof(f))
  14. #define NAME "file"
  15.  
  16. const int N = 2e5 + 5, mod = 1e9 + 7;
  17. int n , k , a[21] , b[21] , p[21] , cnt = 0 , ans = -1 , cur = 0 , val = 0;
  18.  
  19. void sol(int i)
  20. {
  21. if (i > n)
  22. {
  23. if (cnt == k)
  24. ans = max(ans , val);
  25. }
  26. else
  27. {
  28. p[i] = 0;
  29. sol(i + 1);
  30.  
  31. int tem = cur;
  32. if (cnt + 1 <= k && a[i] != cur)
  33. {
  34. p[i] = 1;
  35. cnt++;
  36. cur = a[i];
  37. val += b[i];
  38.  
  39. sol(i + 1);
  40.  
  41. cur = tem;
  42. val -= b[i];
  43. cnt--;
  44. }
  45. }
  46. }
  47.  
  48. signed main()
  49. {
  50. ios_base::sync_with_stdio(0);
  51. cin.tie(0); cout.tie(0);
  52. //freopen(NAME".INP" , "r" , stdin);
  53. //freopen(NAME".OUT" , "w" , stdout);
  54.  
  55. cin >> n >> k;
  56. for (int i = 1 ; i <= n ; i++)
  57. cin >> a[i] >> b[i];
  58. sol(1);
  59. cout << ans;
  60. }
  61. // haronnee_
Success #stdin #stdout 0s 5308KB
stdin
Standard input is empty
stdout
Standard output is empty