Submission #1084906

#	Time	Username	Problem	Language	Result	Execution time	Memory
1084906		pemguimn	Fortune Telling 2 (JOI14_fortune_telling2)	C++14	0 / 100	1 ms	348 KiB

fortune_telling2

#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;
int n, k, a[N], b[N], t[N];
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    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];

    int ans = 0;
    for(int i = 1; i <= k; i++){
        for(int j = 1; j <= n; j++){
            if(a[j] <= t[i]) swap(a[j], b[j]);
        }
    }

    for(int i = 1; i <= n; i++) ans += a[i];
    cout << ans << '\n';
    return 0;
}

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