Cod sursa(job #1709855)
Utilizator | Usurelu Florian pyflori | Data | 28 mai 2016 14:12:07 |
---|---|---|---|
Problema | Metrou4 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest | Marime | 0.87 kb |
#include <fstream>
using namespace std;
ifstream f ("metrou4.in");
ofstream g ("metrou4.out");
int x[150001],y[150001],i,j,l,t,n;
long long cost,costy;
int main()
{
f>>t;
for(l=1;l<=t;++l)
{
f>>n;
for(i=1;i<=n;++i) f>>x[i]>>y[i];
for(i=1;i<n;++i)
{
for(j=i+1;j<=n;++j)
{
if(x[i]>x[j])
{
swap(x[i],x[j]);
swap(y[i],y[j]);
}
if(x[i]==x[j])
{
if(y[i]>y[j]) swap(y[i],y[j]);
}
}
}
cost=x[1]+y[1];
for(i=2;i<=n;++i)
{
costy=y[i]-y[i-1];
if(costy<0) costy-=costy;
cost=cost-x[i-1]+x[i]+costy;
}
g<<cost<<"\n";
}
return 0;
}