# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
34576 | sinhriv | Watching (JOI13_watching) | C++14 | 809 ms | 20980 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 2202;
int n, p, q;
int a[N];
int f[N][N];
int one[N];
int two[N];
int main(){
if(fopen("1.inp", "r")){
freopen("1.inp", "r", stdin);
}
scanf("%d%d%d", &n, &p, &q);
for(int i = 1; i <= n; ++i){
scanf("%d", a + i);
}
p = min(p, n);
q = min(q, n);
sort(a + 1, a + n + 1);
int low = 1, high = 1e9, ans = 1e9;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |