Submission #500566

#	Time	Username	Problem	Language	Result	Execution time	Memory
500566		kappa	Preokret (COCI18_preokret)	C++14	50 / 50	1 ms	332 KiB

preokret

#include <bits/stdc++.h>

using namespace std;

int a, b, suma, sumb, trn, half;

priority_queue<pair<int, int> > pq;

int main(){
    cin >> a;

    while(a--){
        int t;
        cin >> t;
        pq.push({-t, 0});
    }

    cin >> b;

    while(b--){
        int t;
        cin >> t;
        pq.push({-t, 1});
    }

    int kayb = -1;

    while(!pq.empty()){
        pair<int, int> curr = pq.top();
        pq.pop();

        if(-curr.first <= 1440) half++;

        if(curr.second == 0){
            suma++;
        }else{
            sumb++;
        }

        if(kayb == 0 && suma > sumb) trn++;
        else if(kayb == 1 && sumb > suma) trn++;

        if(suma != sumb) kayb = suma > sumb;
    }

    cout << half << "\n" << trn;
}

• Subtask 1: 50 / 50