#include<iostream>
using namespace std;
int main()
{
    int n,h,x,y,l=0;
    cin>>n>>h;
    for(int i=1;i<=n;i++)
    {
        cin>>x>>y;
        if(x<=h)
            l+=y;
    }
    cout<<l;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,h,sum=0; cin>>n>>h;
    pair<int,int> p[n];
    for(int i=0;i<n;i++) cin>>p[i].first>>p[i].second;
    for(int i=0;i<n;i++) if(p[i].first<=h) sum+=p[i].second;
    cout<<sum;
    return 0;
}

#include<iostream>
using namespace std;
int main(){
int n,h,cnt=0;
cin>>n>>h;
for(int i=1;i<=n;i++){
int hight,heavy;
cin>>hight>>heavy;
if(hight<=h){
cnt+=heavy;
}
}
cout<<cnt;
return 0;
}

#include<iostream>
using namespace std;
int main()
{
    int n,h,x,y,l=0;
    cin>>n>>h;
    for(int i=1;i<=n;i++)
    {
        cin>>x>>y;
        if(x<=h)
            l+=y;
    }
    cout<<l;
    return 0;
}

#include<iostream>
using namespace std;
int main()
{
    int n,h,x,y,l=0;
    cin>>n>>h;
    for(int i=1;i<=n;i++)
    {
        cin>>x>>y;
        if(x<=h)
            l+=y;
    }
    cout<<l;
    return 0;
}

#include<iostream>
using namespace std;
int main()
{
    int n,h,x,y,l=0;
    cin>>n>>h;
    for(int i=1;i<=n;i++)
    {
        cin>>x>>y;
        if(x<=h)
            l+=y;
    }
    cout<<l;
    return 0;
}

#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main()
{
int n,h,x,y;
cin>>n>>h;
int sum=0;
for(int i=0;i<n;i++)
{
cin>>x>>y;
if(x<=h)
sum+=y;
}
cout<<sum;
return 0;
}

#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main()
{
int n,h,x,y;
cin>>n>>h;
int sum=0;
for(int i=0;i<n;i++)
{
cin>>x>>y;
if(x<=h)
sum+=y;
}
cout<<sum;
return 0;
}

#include<iostream>
using namespace std;
int main()
{
int n,h,x,y,l=0;
cin>>n>>h;
for(int i=1;i<=n;i++)
{
cin>>x>>y;
if(x<=h)
l+=y;
}
cout<<l;
return 0;
}

用容器的最短代码。。通俗易懂

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,h,sum=0; cin>>n>>h;
    pair<int,int> p[n];
    for(int i=0;i<n;i++) cin>>p[i].first>>p[i].second;
    for(int i=0;i<n;i++) if(p[i].first<=h) sum+=p[i].second;
    cout<<sum;
    return 0;
}