Submission #218055

#	Time	Username	Problem	Language	Result	Execution time	Memory
218055		andreiomd	Fortune Telling 2 (JOI14_fortune_telling2)	C++11	4 / 100	9 ms	768 KiB

fortune_telling2

#include <bits/stdc++.h>

using namespace std;

const int NMAX = 2e5 + 5;

int N, K;

int A[NMAX], B[NMAX], T[NMAX];

static inline void Read ()
{
    ios_base :: sync_with_stdio(false);
    cin.tie(NULL);

    cin >> N >> K;

    for(int i = 1; i <= N; ++i)
        cin >> A[i] >> B[i];

    for(int i = 1; i <= K; ++i)
        cin >> T[i];

    return;
}

static inline void Brute ()
{
    for(int i = 1; i <= K; ++i)
    {
        for(int j = 1; j <= N; ++j)
            if(A[j] <= T[i])
                swap(A[j], B[j]);
    }

    long long Sum = 0;

    for(int i = 1; i <= N; ++i)
        Sum += 1LL * A[i];

    cout << Sum << '\n';

    return;
}

static inline void Solve ()
{
    if(N <= 1e3 && K <=  1e3)
        Brute();

    return;
}

int main()
{
    Read();

    Solve();

    return 0;
}

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