# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9117 | 2014-09-27T12:33:47 Z | pichulia | Penalty calculation (kriii2_PE) | C++ | 0 ms | 0 KB |
#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",&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); } } }