# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164756 | ReLice | Watching (JOI13_watching) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#define ll int
#define ld double
#define pb push_back
#define pf push_front
#define ins insert
#define fr first
#define sc second
#define endl "\n"
#define ar array
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
void start(){ios_base::sync_with_stdio(NULL);cin.tie(nullptr);cout.tie(nullptr);}
const ll inf = 1e9;
const ll mod = 1e9 + 7;
const ll N = 1e5 + 8;
void solve() {
ll i, j;
ll n, p, q;
cin>>n>>p>>q;
vector<ll> a(n);
for(i=0;i<n;i++) cin>>a[i];
sort(all(a));