fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #pragma region Macros
  5. #define Faster ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
  6. #define ll long long
  7. #define ld long double
  8. #define pii pair<int, int>
  9. #define pll pair<long long, long long>
  10. #define all(x) x.begin(), x.end()
  11. #define rall(x) x.rbegin(), x.rend()
  12. #define pb push_back
  13. #define ff first
  14. #define ss second
  15. #define endl '\n'
  16. #define yes cout << "YES" << endl
  17. #define no cout << "NO" << endl
  18. #define m1 cout << -1 << endl
  19. #pragma endregion
  20.  
  21. #pragma region Math
  22. const ll MOD = 1e9 + 7;
  23. ll gcd(ll a, ll b) { return __gcd(a, b); }
  24. ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
  25. #pragma endregion
  26.  
  27. void solve() {
  28. ll n,l,r; cin>>n>>l>>r;
  29. vector<int>v(n), a,b;
  30. for(auto &it:v) cin>>it;
  31. ll sum1=0, sum2=0;
  32. for(int i=0;i<r;i++)
  33. a.push_back(v[i]);
  34. for(int i=l-1;i<n;i++)
  35. b.push_back(v[i]);
  36. sort(all(a));
  37. sort(all(b));
  38. for(int i=0;i<r-l+1;i++){
  39. sum1+=a[i];
  40. sum2+=b[i];
  41. }
  42. cout<<min(sum1, sum2)<<endl;
  43. }
  44.  
  45. int main() {
  46. Faster;
  47. int t = 1;
  48. cin >> t;
  49. while (t--) solve();
  50. return 0;
  51. }
Success #stdin #stdout 0s 5320KB
stdin
6
2 1 1
2 1
3 2 3
1 2 3
3 1 3
3 1 2
4 2 3
1 2 2 2
5 2 5
3 3 2 3 5
6 1 3
3 6 6 4 3 2
stdout
1
3
6
3
11
8