# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624278 | Vovamatrix | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 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.
//https://oj.uz/problem/view/IOI16_molecules
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define sc second
#define th third
#define fo fourth
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
#define endl "\n"
#define all(data) data.begin(),data.end()
#define TYPEMAX(type) std::numeric_limits<type>::max()
#define TYPEMIN(type) std::numeric_limits<type>::min()
#define MAXN 200007
ll w[MAXN];
ll prefsum[MAXN];
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
ll n,l,u; cin>>n>>l>>u;
for(int i=1;i<=n;i++) cin>>w[i];
sort(w+1,w+n+1);
prefsum[0]=0;
for(int i=1;i<=n;i++) prefsum[i]=prefsum[i-1]+w[i];
ll itr1=0,itr2=1;
bool check=false;
while(itr2<=n)
{
if(prefsum[itr2]-prefsum[itr1]>u) itr1++;
else if(prefsum[itr2]-prefsum[itr1]<l) itr2++;
else
{
for(int i=itr1+1;i<=itr2;i++) cout<<w[i]<<" ";
check=true;
break;
}
}
return 0;
}