#675851 (C++17) No.1597 Matrix Sort

• 問題: No.1597 Matrix Sort
• ユーザー: nrvft
• 提出日時: 2021-07-09 21:51:04
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 364 ms / 1,500 ms
• コード長: 2,436 bytes
• コンパイル時間: 2,182 ms
• コンパイル使用メモリ: 207,992 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-01 15:57:24
• 合計ジャッジ時間: 8,352 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	326 ms; 5,376 KB
testcase_04	AC	345 ms; 5,376 KB
testcase_05	AC	359 ms; 5,376 KB
testcase_06	AC	364 ms; 5,376 KB
testcase_07	AC	355 ms; 5,376 KB
testcase_08	AC	247 ms; 5,376 KB
testcase_09	AC	258 ms; 5,376 KB
testcase_10	AC	164 ms; 5,376 KB
testcase_11	AC	122 ms; 5,376 KB
testcase_12	AC	128 ms; 5,376 KB
testcase_13	AC	263 ms; 5,376 KB
testcase_14	AC	297 ms; 5,376 KB
testcase_15	AC	94 ms; 5,376 KB
testcase_16	AC	146 ms; 5,376 KB
testcase_17	AC	165 ms; 5,376 KB
testcase_18	AC	327 ms; 5,376 KB
testcase_19	AC	210 ms; 5,376 KB
testcase_20	AC	160 ms; 5,376 KB
testcase_21	AC	152 ms; 5,376 KB
testcase_22	AC	154 ms; 5,376 KB
testcase_23	AC	148 ms; 5,376 KB
testcase_24	AC	31 ms; 5,376 KB
testcase_25	AC	27 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	2 ms; 5,376 KB
testcase_29	AC	2 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;

#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)

template<class T1, class T2> inline bool chmax(T1 &a, const T2 &b) {if (a<b) { a=b; return 1;} return 0;}
template<class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {if (b<a) { a=b; return 1;} return 0;}
struct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);cerr<<fixed<<setprecision(15);}}init_;

#ifdef DEBUG
template <class T> void verr(const set<T> &st) { repa(a, st) cerr << a << " "; cerr << endl; }
template <class S, class T> void verr(const map<S, T> &mp) { repa(a, mp) cerr << "{" << a.first << ", " << a.second << "} "; cerr << endl; }
template <class S, class T, class N> void verr(const vector<pair<S,T>>& a, const N& n) { rep(i, n) cerr << "{" << a[i].first << ", " << a[i].second << "} "; cerr << endl; }
template <class T, class N> void verr(const vector<T>& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << endl; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << endl; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif

const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//

int main() {
    ll N, K, P;
    cin >> N >> K >> P;
    vl A(N), B(N);
    rep(i, N) cin >> A[i];
    rep(i, N) cin >> B[i];
    sort(all(A)), sort(all(B));

    ll ok = P, ng = -1;
    while(ok - ng > 1){
        ll mid = (ok + ng) / 2;
        ll cnt = 0;
        rep(i, N){
            ll pi = lower_bound(all(B), P - A[i]) - B.begin();
            ll mi = upper_bound(all(B), mid - A[i]) - B.begin();
            ll mi2 = upper_bound(all(B), mid - A[i] + P) - B.begin();
            cnt += mi + (mi2 - pi);
        }
        // err(mid, cnt);
        (cnt >= K ? ok : ng) = mid;
    }

    cout << ok << endl;
}