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 <stdio.h>
#include <algorithm>
using namespace std;
long long s[101], t[101];
int main(int argc, char** argv)
{
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
{
scanf("%lld %lld", &t[i], &s[i]);
}
long long maxv = s[0];
for (int i = 1; i <= n; ++i)
{
maxv = max(s[i], maxv);
}
long long result = 0;
for (int i = 1; i <= n; ++i)
{
if (s[i] == maxv)
{
if (s[i] == 1 || s[i] == 4)
{
result += t[i] + (i - 1) * 20;
break;
}
}
}
printf("%lld\n", result);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |