#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define SIZE(x) (int)(x).size()
#define ff first
#define ss second
inline ll readi(){
ll x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int main(){
int N=readi();
while(N--){
int a=readi(),b=readi();
if(a>b)a=b;
cout<<2*a-2<<endl;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2016 KB |
Output is correct |
2 |
Correct |
0 ms |
2016 KB |
Output is correct |
3 |
Correct |
0 ms |
2016 KB |
Output is correct |
4 |
Correct |
0 ms |
2016 KB |
Output is correct |
5 |
Correct |
0 ms |
2016 KB |
Output is correct |
6 |
Correct |
39 ms |
2016 KB |
Output is correct |
7 |
Correct |
63 ms |
2016 KB |
Output is correct |
8 |
Correct |
23 ms |
2016 KB |
Output is correct |
9 |
Correct |
29 ms |
2016 KB |
Output is correct |
10 |
Correct |
46 ms |
2016 KB |
Output is correct |