14782022-11-05 22:10:37peti1234Egyengetőcpp14Wrong answer 0/1003ms4096 KiB
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;
int n, k;
long long ans;
priority_queue<int> kis;
priority_queue<int, vector<int>, greater<int> > nagy;
int main()
{   
    return 0;
    /*n=getN(), k=getK();
    for (int i=0; i<n; i++) {
        int ert=Data();
        kis.push(ert), nagy.push(ert+k);
        int a=kis.top(), b=nagy.top();
        if (a>b) {
            ans+=a-b;
            kis.pop(), nagy.pop();
            kis.push(b), nagy.push(a);
        }
        Solution(ans);
    }*/
    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Wrong answer3ms1864 KiB
2Wrong answer2ms2124 KiB
subtask20/20
3Wrong answer2ms2260 KiB
4Wrong answer2ms2468 KiB
5Wrong answer2ms2676 KiB
6Wrong answer2ms2872 KiB
7Wrong answer2ms3076 KiB
8Wrong answer2ms3284 KiB
subtask30/20
9Wrong answer2ms3256 KiB
10Wrong answer2ms3368 KiB
11Wrong answer2ms3484 KiB
12Wrong answer2ms3460 KiB
13Wrong answer2ms3696 KiB
14Wrong answer2ms3668 KiB
subtask40/20
15Wrong answer2ms3892 KiB
16Wrong answer2ms3868 KiB
17Wrong answer2ms3868 KiB
18Wrong answer2ms3872 KiB
19Wrong answer2ms3868 KiB
20Wrong answer2ms3876 KiB
subtask50/40
21Wrong answer2ms3868 KiB
22Wrong answer2ms3872 KiB
23Wrong answer2ms3872 KiB
24Wrong answer2ms3976 KiB
25Wrong answer2ms3996 KiB
26Wrong answer2ms4096 KiB