Ice cream

input/code.cpp: In function 'int main()':
input/code.cpp:51:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int a=0;a<po.size();a++){
                               ^
input/code.cpp:48:45: warning: 'lw1' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if(p[a]<=left1) po.push_back(lw1+w[a]);
                                             ^
input/code.cpp:43:19: warning: 'clw1' may be used uninitialized in this function [-Wmaybe-uninitialized]
     if((x/2-p[clw1])>=0) cout << 2*lw1 << endl;
                   ^
input/code.cpp:46:48: warning: 'clw2' may be used uninitialized in this function [-Wmaybe-uninitialized]
         int left1=x-p[clw1]; int left2=x-p[clw2];
                                                ^
input/code.cpp:49:45: warning: 'lw2' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if(p[a]<=left2) po.push_back(lw2+w[a]);...

#include <iostream>     // for(int i=0;i<n;i++){}
#include <stdio.h>
#include <ctype.h>
#include <iomanip>      // setprecision cout<<fixed<<setprecision(10)<<ans;
#include <cmath>
#include <string>
#include <vector>
#include <stack>
#include <locale>
#include <sstream>
#include <algorithm>
#include <queue>
#include <string.h>

using namespace std;

int main()
{
    int n,x,lw1,clw1,lw2,clw2;
    cin >> n >> x;
    vector<long long>p(n); vector<long long>w(n);
    for(int a=0;a<n;a++){
        cin >> p[a] >> w[a] ;
    }
    if(n!=1){
    for(int a=0;a<n;a++){
        if(p[a]<x){
        if(a==0){ lw1=w[a]; clw1=a;}
        else{
            if((w[a]==lw1&&p[a]<p[clw1])||w[a]>lw1){ lw1=w[a]; clw1=a; }
        }
        }
    }
    for(int a=0;a<n;a++){
        if(a==clw1&&a==0){
            lw2=w[a+1]; clw2=a+1;
        }else if(a==clw1){
        }else{
           if(a==0){lw2=w[a]; clw2=a;}
           else{ if((w[a]==lw2&&p[a]<p[clw2])||w[a]>lw2){ lw2=w[a]; clw2=a; }}
        }
    }
    if((x/2-p[clw1])>=0) cout << 2*lw1 << endl;
    else{
        vector<long long>po;
        int left1=x-p[clw1]; int left2=x-p[clw2];
        for(int a=0;a<n;a++){
            if(p[a]<=left1) po.push_back(lw1+w[a]);
            if(p[a]<=left2) po.push_back(lw2+w[a]);
        }
        for(int a=0;a<po.size();a++){
            if(a==0) lw1=po[a];
            else{
            if(po[a]>lw1) lw1=po[a];
            }
        }
        cout << lw1 << endl;
    }
    }else cout << 2*w[0] << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: RUNTIME ERROR

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: WRONG ANSWER