func_code_string: #include <bits/stdc++.h>   using namespace std;   int a[100005], b[100005];   long long int n, m, k;   long long int judge(long long int x) {     long long int sum = 0;     for (int t = 0; t < x; t++) {       if (a[n - x + t] < b[t]) {         sum = sum + b[t] - a[n - x + t];       }     }     return sum;   }   int main() {     cin >> n >> m >> k;     for (int t = 0; t < n; t++) {       scanf( %d , &a[t]);     }     sort(a, a + n);     for (int t = 0; t < m; t++) {       scanf( %d , &b[t]);     }     sort(b, b + m);     long long int s1 = 0;     long long int left = 0;     long long int right = min(n, m);     while (left <= right) {       long long int mid = (left + right) >> 1;       if (judge(mid) <= k) {         left = mid + 1;         s1 = mid;       } else         right = mid - 1;     }     long long int ans = 0;     for (int t = 0; t < s1; t++) {       ans += b[t];     }     if (ans - k > 0)       ans = ans - k;     else       ans = 0;     printf( %lld %lld n , s1, ans);     return 0;   }   