# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
918842 | SalihSahin | Watching (JOI13_watching) | C++14 | 164 ms | 8072 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>
#define pb push_back
#define mp make_pair
#define int long long
using namespace std;
const int mod = 1e9 + 7;
const int inf = 1e9;
const int N = 2e3 + 5;
int32_t main(){
cin.tie(0); cout.tie(0);
ios_base::sync_with_stdio(false);
int n, p, q;
cin>>n>>p>>q;
p = min(p, n);
q = min(q, n);
vector<int> a(n);
for(int i = 0; i < n; i++){
cin>>a[i];
}
sort(a.begin(), a.end());
if(p + q >= n){
cout<<1<<endl;
return 0;
}
vector<int> sm(N), bg(N);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |