#include<stdio.h>
#include<algorithm>
using namespace std;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
int n, m;
piii a[1009];
int main()
{
scanf("%d",&n);
int i, j;
for(i=0;i<n;i++)
{
scanf("%d %d",&a[i].first.first,&a[i].first.second);
a[i].second = i;
}
sort(a,a+n);
for(i=0;i<n;i++)
if(a[i].first.second != 0)
break;
if(i==n)
{
printf("0\n");
}
else
{
for(i=0;i<n;i++)
if(a[i].first.second > 1)
break;
if(i==n)
{
for(i=0;i<n;i++)
if(a[i].first.second == 1)
break;
printf("%d\n",a[i].first.first + a[i].second*20);
}
else
{
for(i=0;i<n;i++)
if(a[i].first.second == 4)
break;
printf("%d\n",a[i].first.first + a[i].second*20);
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1100 KB |
Output is correct |
2 |
Correct |
0 ms |
1100 KB |
Output is correct |
3 |
Correct |
0 ms |
1100 KB |
Output is correct |
4 |
Correct |
0 ms |
1100 KB |
Output is correct |
5 |
Correct |
0 ms |
1100 KB |
Output is correct |
6 |
Correct |
0 ms |
1100 KB |
Output is correct |
7 |
Correct |
0 ms |
1100 KB |
Output is correct |
8 |
Correct |
0 ms |
1100 KB |
Output is correct |
9 |
Correct |
0 ms |
1100 KB |
Output is correct |
10 |
Correct |
0 ms |
1100 KB |
Output is correct |
11 |
Correct |
0 ms |
1100 KB |
Output is correct |
12 |
Correct |
0 ms |
1100 KB |
Output is correct |
13 |
Correct |
0 ms |
1100 KB |
Output is correct |
14 |
Correct |
0 ms |
1100 KB |
Output is correct |
15 |
Correct |
0 ms |
1100 KB |
Output is correct |
16 |
Correct |
0 ms |
1100 KB |
Output is correct |
17 |
Correct |
0 ms |
1100 KB |
Output is correct |
18 |
Correct |
0 ms |
1100 KB |
Output is correct |
19 |
Correct |
0 ms |
1100 KB |
Output is correct |
20 |
Correct |
0 ms |
1100 KB |
Output is correct |
21 |
Correct |
0 ms |
1100 KB |
Output is correct |
22 |
Correct |
0 ms |
1100 KB |
Output is correct |
23 |
Correct |
0 ms |
1100 KB |
Output is correct |
24 |
Correct |
0 ms |
1100 KB |
Output is correct |
25 |
Correct |
0 ms |
1100 KB |
Output is correct |
26 |
Correct |
0 ms |
1100 KB |
Output is correct |
27 |
Correct |
0 ms |
1100 KB |
Output is correct |
28 |
Correct |
0 ms |
1100 KB |
Output is correct |
29 |
Correct |
0 ms |
1100 KB |
Output is correct |
30 |
Correct |
0 ms |
1100 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1100 KB |
Output is correct |
2 |
Correct |
0 ms |
1100 KB |
Output is correct |
3 |
Correct |
0 ms |
1100 KB |
Output is correct |
4 |
Correct |
0 ms |
1100 KB |
Output is correct |
5 |
Correct |
0 ms |
1100 KB |
Output is correct |
6 |
Correct |
0 ms |
1100 KB |
Output is correct |
7 |
Correct |
0 ms |
1100 KB |
Output is correct |
8 |
Correct |
0 ms |
1100 KB |
Output is correct |
9 |
Correct |
0 ms |
1100 KB |
Output is correct |
10 |
Correct |
0 ms |
1100 KB |
Output is correct |
11 |
Correct |
0 ms |
1100 KB |
Output is correct |
12 |
Correct |
0 ms |
1100 KB |
Output is correct |
13 |
Correct |
0 ms |
1100 KB |
Output is correct |
14 |
Correct |
0 ms |
1100 KB |
Output is correct |
15 |
Correct |
0 ms |
1100 KB |
Output is correct |
16 |
Correct |
0 ms |
1100 KB |
Output is correct |
17 |
Correct |
0 ms |
1100 KB |
Output is correct |
18 |
Correct |
0 ms |
1100 KB |
Output is correct |
19 |
Correct |
0 ms |
1100 KB |
Output is correct |
20 |
Correct |
0 ms |
1100 KB |
Output is correct |
21 |
Correct |
0 ms |
1100 KB |
Output is correct |
22 |
Correct |
0 ms |
1100 KB |
Output is correct |
23 |
Correct |
0 ms |
1100 KB |
Output is correct |
24 |
Correct |
0 ms |
1100 KB |
Output is correct |
25 |
Correct |
0 ms |
1100 KB |
Output is correct |
26 |
Correct |
0 ms |
1100 KB |
Output is correct |
27 |
Correct |
0 ms |
1100 KB |
Output is correct |
28 |
Correct |
0 ms |
1100 KB |
Output is correct |
29 |
Correct |
0 ms |
1100 KB |
Output is correct |
30 |
Correct |
0 ms |
1100 KB |
Output is correct |