oj.uz

Submission #1084904

# Submission time Handle Problem Language Result Execution time Memory
1084904 2024-09-07T08:06:56 Z pemguimn Fortune Telling 2 (JOI14_fortune_telling2) C++14
0 / 100
 1 ms 344 KB 
#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] <= b[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.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -