//Yel #include <bits/stdc++.h> #define fast ios_base::sync_with_stdio(false); cin.tie(0); #define pb push_back #define np next_permutation #define YES {cout<<"YES";rt} #define NO {cout<<"NO";rt;} #define Yes cout<<"Yes"; #define No cout<<"No"; #define rep(st,pl,en) for(ll i=st;i<=en;i+=pl) #define ll long long #define sz size() #define pi pair<int,int> #define F first #define S second #define dot fixed<<setprecision #define str string #define all(x) x.begin(),x.end() #define allr(x) x.rbegin(),x.rend() #define rt return #define dl long double #define Pi 3.141592653589793238462643383279 #define cnl cout<<'\n'; #define nl '\n' #define int ll #define co continue #define open freopen("slalom.in","r",stdin);freopen("slalom.out","w",stdout); using namespace std; const int inf=1e18,mod=1e9+7,N=2e5+9; pair <int,int> a[N]; int b[N],used[N]; void abdu_abi(){ int n,vmx,v2; cin>>n>>vmx>>v2; vector <int> v; for(int i=1;i<=n;i++){ char t; cin>>t>>b[i]; if(i==1){ co; } a[i].F=b[i]-b[i-1]; if(!used[a[i].F]){ v.pb(a[i].F); used[a[i].F]=1; } a[i].S=(t=='+'?1:-1); //cout<<a[i].F<<nl; } int more_than=0,ans=v2; v.pb(0); sort(allr(v)); for(int k=0;k<=vmx;k++){ int sum=k; for(int our:v){ for(int i=2;i<=n;i++){ if(a[i].F<=our){ sum+=a[i].S; sum=max(0ll,sum); sum=min(sum,vmx); } } if(sum==v2){ if(more_than<=our){ more_than=our; ans=k; } } } } //cout<<more_than<<nl; for(int i=1;i<v.sz;i++){ if(more_than==v[i]){ cout<<v[i-1]-1<<" "<<ans; rt; } } cout<<"infinity"; } main(){ //open; fast; int t=1; //cin>>t; while(t--){ abdu_abi(); } }

mp3player.cpp:80:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   80 | main(){
      | ^~~~