Submission #499939

#	Time	Username	Problem	Language	Result	Execution time	Memory
499939		ac2hu	Watching (JOI13_watching)	C++14	0 / 100	1 ms	332 KiB

watching

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2000;
int n,p,q;
int a[maxn];
int dp[maxn][maxn];
bool check(int w){
	return false;
}
void solve(){
	cin >> n >> p >> q;
	if(p > n || q > n){
		cout << 1 << "\n";
		return;
	}
	for(int i = 0;i<n;i++)cin >> a[i];
	sort(a,a + n);
	int l = 1,r = 1e9;
	while(l < r){
		int w = (l + r - 1)/2;
		if(check(w)){
			r = w;	
		}
		else 
			l = w + 1;
	}
	cout << l << "\n";
}
signed main(){
	iostream::sync_with_stdio(false);
	cin.tie(nullptr);cout.tie(nullptr);
	int T = 1;
	// cin >> T;
	while(T--){
		solve();
	}
}

• Subtask 1: 0 / 50
• Subtask 2: 0 / 50