#include <cstdio> #include <cstdlib> #include <algorithm> int main(void){ int n=0, x=0; int first = 10; int second = 10; scanf("%d", &n); char *t = (char *)malloc(4*sizeof(char)); for (int i = 0; i < n; ++i) { scanf("%s %d", t, &x); if(t[0]=='N') { continue; } if(first>0){ printf("%d ", i + 1); --first; } else if(second>0) { if(x<2){ printf("%d ", i + 1); --second; } } else { break; } } printf("\n"); return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 | #include <cstdio> #include <cstdlib> #include <algorithm> int main(void){ int n=0, x=0; int first = 10; int second = 10; scanf("%d", &n); char *t = (char *)malloc(4*sizeof(char)); for (int i = 0; i < n; ++i) { scanf("%s %d", t, &x); if(t[0]=='N') { continue; } if(first>0){ printf("%d ", i + 1); --first; } else if(second>0) { if(x<2){ printf("%d ", i + 1); --second; } } else { break; } } printf("\n"); return 0; } |