Code: Select all
#include<cstdio>
#include<sstream>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<list>
#include<iostream>
#include<fstream>
#include<numeric>
#include<string>
#include<vector>
#include<cstring>
#include<map>
#include<iterator>
using namespace std;
int main()
{
int n,g,s,r,l;
while(cin>>n>>g)
{
vector<int>vr,vs,vvr,vvs;
queue<int>qr,qs;
for(int i=0; i<n; i++)
{
cin>>s>>r;
vs.push_back(s);
vr.push_back(r);
}
int sum=0;
if(vs.size()>=vr.size())
{
l=vs.size();
}
else
{
l=vr.size();
}
for(int j=0; j<l; j++)
{
if(vs[j]>vr[j])
{
vvs.push_back(vs[j]);
vvr.push_back(vr[j]);
}
}
for(int j=0; j<l; j++)
{
if(vs[j]==vr[j])
{
vvs.push_back(vs[j]);
vvr.push_back(vr[j]);
}
}
for(int j=0; j<l; j++)
{
if(vs[j]<vr[j])
{
vvs.push_back(vs[j]);
vvr.push_back(vr[j]);
}
}
int l2;
if(vvs.size()>=vvr.size())
{
l2=vvs.size();
}
else
{
l2=vvr.size();
}
for(int i=0; i<l2; i++)
{
if(vvs[i]>vvr[i])
{
sum+=3;
}
else if(vvs[i]==vvr[i])
{
if(g==0)
{
sum+=1;
}
else
{
sum+=3;
g=g-1;
}
}
else
{
if(g==0)
{
sum+=0;
}
else if((vvr[i]-vvs[i])>g)
{
sum+=0;
}
else if((vvr[i]-vvs[i])==g)
{
sum+=1;
g=g-g;
}
else
{
sum+=3;
g=g-(vvr[i]-vvs[i]+1);
}
}
}
cout<<sum<<endl;
}
return 0;
}