提出 #43431853

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define rep(i, f, t) for(int i(f); i <= t; ++i)
#define re(i, t) for(int i(1); i <= t; ++i)
#define per(i, t, f) for(int i(t); i >= f; --i)
#define pe(i, t) for(int i(t); i >= 1; --i)
#define each(i, x) for(auto &i : (x))
#define nx(i, u) for(int i(head[u]); i; i = e[i].nxt) 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <double, int> pdi;
typedef pair <int, int> pii;
typedef pair <int, pair<int, int> > pipii;
typedef pair <string, bool> psb;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define mkp make_pair
#define ix(l, r) ((l + r) | (l != r))
#define lowbit(x) (x & -x)
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define dinf 1000000000000.0
#define eps 1e-10
#define FileIn(x) freopen(x,"r",stdin)
#define FileOut(x) freopen(x,"w",stdout)
#define FileIO(x,y) FileIn(x);FileOut(y)
#define SYSP system("pause")
#define CIOO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define int long long
// #pragma GCC optimize(1)
// #pragma GCC optimize(2)
// #pragma GCC optimize(3,"Ofast")
const int N(200005);
int n,a[N],b[N];
multiset<pipii> s;
signed main(){
    CIOO;
    cin>>n;
    re(i,n){
        cin>>a[i]>>b[i];
    }
    ll ans=0;
    re(i,n){
        // ans+=a[i];
        s.insert(mkp(a[i]-b[i],mkp(a[i],b[i])));
    }
    pipii now;
    re(i,n){
        auto it=s.rbegin();
        now=(*it);
        s.erase(s.find(now));
        // cerr<<now.fi<<'\n';
        s.insert(mkp(-now.fi,mkp(now.se.se,now.se.fi)));
        // auto it2=s.find
        // it=s.rbegin();
        // if(s.empty())break;
        // cerr<<"A";
        auto it2=s.rbegin();
        // cerr<<"A";
        now=*it2;
        ans+=now.se.fi;
        if(s.empty())break;
        s.erase(s.find(now));
        // s.erase(s.find(now));
    }
    cout<<ans;
}

提出情報

提出日時
問題 C - Reversible Card Game
ユーザ oh_my_shy
言語 C++ (GCC 9.2.1)
得点 500
コード長 1999 Byte
結果 AC
実行時間 155 ms
メモリ 19136 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 500 / 500
結果
AC × 2
AC × 40
セット名 テストケース
Sample sample-01.txt, sample-02.txt
All in-01.txt, in-02.txt, in-03.txt, in-04.txt, in-05.txt, in-06.txt, in-07.txt, in-08.txt, in-09.txt, in-10.txt, in-11.txt, in-12.txt, in-13.txt, in-14.txt, in-15.txt, in-16.txt, in-17.txt, in-18.txt, in-19.txt, in-20.txt, in-21.txt, in-22.txt, in-23.txt, in-24.txt, in-25.txt, in-26.txt, in-27.txt, in-28.txt, in-29.txt, in-30.txt, in-31.txt, in-32.txt, in-33.txt, in-34.txt, in-35.txt, in-36.txt, in-37.txt, in-38.txt, sample-01.txt, sample-02.txt
ケース名 結果 実行時間 メモリ
in-01.txt AC 153 ms 19100 KiB
in-02.txt AC 155 ms 19088 KiB
in-03.txt AC 151 ms 19120 KiB
in-04.txt AC 149 ms 19064 KiB
in-05.txt AC 131 ms 19076 KiB
in-06.txt AC 130 ms 19112 KiB
in-07.txt AC 132 ms 19084 KiB
in-08.txt AC 2 ms 3516 KiB
in-09.txt AC 1 ms 3508 KiB
in-10.txt AC 2 ms 3456 KiB
in-11.txt AC 2 ms 3388 KiB
in-12.txt AC 2 ms 3436 KiB
in-13.txt AC 2 ms 3452 KiB
in-14.txt AC 2 ms 3532 KiB
in-15.txt AC 2 ms 3468 KiB
in-16.txt AC 2 ms 3452 KiB
in-17.txt AC 2 ms 3392 KiB
in-18.txt AC 2 ms 3492 KiB
in-19.txt AC 37 ms 6948 KiB
in-20.txt AC 18 ms 5280 KiB
in-21.txt AC 86 ms 12164 KiB
in-22.txt AC 104 ms 14976 KiB
in-23.txt AC 91 ms 13704 KiB
in-24.txt AC 4 ms 3524 KiB
in-25.txt AC 4 ms 3596 KiB
in-26.txt AC 5 ms 3660 KiB
in-27.txt AC 7 ms 3740 KiB
in-28.txt AC 2 ms 3480 KiB
in-29.txt AC 2 ms 3464 KiB
in-30.txt AC 2 ms 3504 KiB
in-31.txt AC 2 ms 3520 KiB
in-32.txt AC 2 ms 3400 KiB
in-33.txt AC 2 ms 3544 KiB
in-34.txt AC 148 ms 19076 KiB
in-35.txt AC 146 ms 19064 KiB
in-36.txt AC 144 ms 19136 KiB
in-37.txt AC 147 ms 19088 KiB
in-38.txt AC 147 ms 19088 KiB
sample-01.txt AC 5 ms 3452 KiB
sample-02.txt AC 3 ms 3484 KiB