This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
using namespace std;
int main()
{
int n, maxt = 21000000,maxs = 0,f;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
int t, s;
scanf("%d%d", &t, &s);
if (maxs == s)
{
if (maxt > t)
{
maxt = t;
f = i;
}
}
else
{
maxs = s;
maxt = 210000000;
if (maxt > t)
{
maxt = t;
f = i;
}
}
}
if (maxs == 0)
{
printf("%d\n", 0);
return 0;
}
printf("%d\n", maxt + 20 * (f - 1));
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |