fork download
copy 
  1.     #include <bits/stdc++.h>
  2.     #include <chrono>
  3.     using namespace std;
  4.     using namespace chrono;
  5.     // "AJEET JAIN"----"JAI JINENDRA"  
  6.     /* "णमो अरिहंताणं",
  7.         "णमो सिद्धाणं",
  8.         "णमो आयरियाणं",
  9.         "णमो उवज्झायाणं",
  10.         "णमो लोए सव्वसाहूणं",
  11.         "",
  12.         "एसो पंच नमोक्कारो, सव्व पावप्पणासणो",
  13.         "मंगलाणं च सव्वेसिं, पडमं हवै मंगलं",   */
  14.  
  15.  
  16.     // Aliases to op
  17.     using ll = long long;
  18.     using ull = unsigned long long;
  19.     using ld = double;
  20.     using vll = vector<ll>;
  21.  
  22.  
  23.     // Constants
  24.     constexpr ll INF = 4e18;
  25.     constexpr ld EPS = 1e-9;
  26.     constexpr ll MOD = 1e9 + 7;
  27.  
  28.  
  29.  
  30.     // Macros
  31.     #define F first
  32.     #define S second
  33.     #define all(x) begin(x), end(x)
  34.     #define allr(x) rbegin(x), rend(x)
  35.     #define py cout<<"YES\n";
  36.     #define pn cout<<"NO\n";
  37.     #define forn(i,n) for(int i=0;i<n;i++)
  38.     #define for1(i,n) for(int i=1;i<=n;i++)
  39.  
  40.     // #define insert push_back
  41.     #define pb push_back
  42.     #define MP make_pair
  43.     #define endl '\n'
  44.  
  45.     /*
  46.       remove substring or subarray ---> try to think about sliding w
  47.     
  48.     */                  
  49.  
  50.      /*
  51.       
  52.      Golden Rule
  53.  
  54.      1) problem is easy
  55.      2) proofs is easy
  56.      3) implementation is easy
  57.      
  58.      /*
  59.          ROUGH --
  60.  
  61.          if u have a1 a2 a3 a4 a5
  62.          and       b1 b2 b3 b4 b5
  63.  
  64.          if x = 0 and y = 5 -> b1+b2+b3+b4+b5 = sum_of_b
  65.          if x = 1 and y = 4 -> sum_of_b + max(ai - bi)
  66.          ...
  67.          
  68.                  
  69.      */
  70.  
  71.     void AJNJ(){
  72.        int n, x , y;
  73.        cin >> n >> x >> y;
  74.        vector<ll> a(n) , b(n) , diff(n);
  75.        ll sum_b = 0;
  76.        for(int i = 0 ; i < n ; i++){
  77.             cin >> a[i];
  78.        }
  79.        for(int i = 0 ; i < n ; i++){
  80.             cin >> b[i];
  81.             sum_b += b[i];
  82.        }
  83.        for(int i = 0 ; i < n ; i++){
  84.            diff.push_back(a[i] - b[i]);
  85.        }
  86.        sort(allr(diff));
  87.        ll ans = INT_MIN;
  88.        ll sum = 0;
  89.        forn(i , n){
  90.            if(i + 1 <= x){
  91.                 sum += diff[i];
  92.                 ans = max(ans , sum_b + sum );
  93.            }
  94.            else{
  95.               break;
  96.            }
  97.        }
  98.  
  99.       cout << ans << endl;
  100.     }
  101.  
  102.  
  103.     int main(){
  104.         ios::sync_with_stdio(0);
  105.         cin.tie(0);
  106.         cout.tie(0);
  107.         int T = 1;
  108.         cin>>T;
  109.         auto start1 = high_resolution_clock::now();
  110.         while(T--){
  111.             AJNJ();
  112.         }
  113.         auto stop1 = high_resolution_clock::now();
  114.         auto duration = duration_cast<microseconds>(stop1 - start1);
  115.         cerr << "Time: " << duration . count() / 1000 << " ms" << endl;
  116.  
  117.         return 0;
  118.     }
Success #stdin #stdout #stderr 0.01s 5312KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
-2147483648
stderr
copy 
Time: 0 ms
https://ideone.com/GTxsDw
language:
C++14 (clang 8.0)
created:
18 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!