#include <stdio.h> #include <algorithm> using namespace std; int s[100], t[100]; int main(int argc, char** argv) { int n; scanf("%d", &n); for (int i = 0; i < n; ++i) { scanf("%d %d", &t[i], &s[i]); } int maxv = s[0]; for (int i = 0; i < n; ++i) { maxv = max(s[i], maxv); } int result = 0; for (int i = 0; i < n; ++i) { if (s[i] == maxv) { //printf("%d %d %d %d\n", result, t[i], i, s[i]); if (s[i] == 1 || s[i] == 4) { result += t[i] + (i) * 20; } //printf("%d\n", result); } } printf("%d\n", result); return 0; }