Submission #447743

#	Time	Username	Problem	Language	Result	Execution time	Memory
447743		blue	Fortune Telling 2 (JOI14_fortune_telling2)	C++17	4 / 100	3073 ms	1256 KiB

fortune_telling2

#include <iostream>
using namespace std;

int main()
{
    int N, K;
    cin >> N >> K;

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

    for(int j = 1; j <= K; j++)
    {
        int T;
        cin >> T;

        for(int i = 1; i <= N; i++)
        {
            if(A[i] <= T) swap(A[i], B[i]);
        }
    }

    long long res = 0;
    for(int i = 1; i <= N; i++) res += A[i];

    cout << res << '\n';
}

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