제출 #1063225

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1063225		JuanproMINE	운세 보기 2 (JOI14_fortune_telling2)	C++14	0 / 100	10 ms	348 KiB

fortune_telling2

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
const int N=200000;
ll n,k;
vector<pair<ll,ll>>cards;


int binary(ll low, ll mid, ll hi, ll val){

    while(low!=mid){
        cout<<low<<" "<<mid<<" "<<hi<<" LO MID HI1"<<endl;
        if(cards[mid].ff<=val){
            low=mid;
            mid=(low+hi+1)/2;
        }else{
            hi=mid;
            mid=(low+hi)/2;
        }
        //cout<<low<<" "<<mid<<" "<<hi<<" LO MID HI2"<<endl;
    }
    //cout<<"a"<<endl;
    return mid;
}

int main(){
    cin >> n >> k;

    for(ll i=0;i<n;i++){
        ll a,b; cin>>a>>b;
        cards.pb({a,b});
    }



    for(ll i=0;i<k;i++){
        sort(cards.begin(),cards.end());

        ll t; cin >> t;
        ll indi=binary(0,((n-1)/2),n-1,t);
        for(ll j=0;j<=indi;j++){


            swap(cards[j].ff,cards[j].ss);
        }


    }
    ll sum=0;
    for(ll x=0;x<n;x++){
        sum+=cards[x].ff;
    }
    cout<<sum<<endl;


}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 31
• Subtask 3: 0 / 65