1083. List Grades (25)

1083. List Grades (25)
 
 

  
  

   
   

    
    时间限制
   
   
   
   

    
    400 ms
    
    

   
   
  
  
  
  

   
   

    
    内存限制
   
   
   
   

    
    65536 kB
    
    

   
   
  
  
  
  

   
   

    
    代码长度限制
   
   
   
   

    
    16000 B
    
    

   
   
  
  
  
  

   
   

    
    判题程序
   
   
   
   

    
    Standard
   
   
  
  
  
  

   
   作者
  
  
  
  

   
   CHEN, Yue
   
   

  
  
 
 
 
 

  
  
Given a list of N student records with name, ID and grade. You are supposed to sort the records with respect to the grade in non-increasing order, and output those student records of which the grades are in a given interval.
  
  
Input Specification:
  
  
Each input file contains one test case. Each case is given in the following format:
  
  
N name[1] ID[1] grade[1] name[2] ID[2] grade[2] ... ... name[N] ID[N] grade[N] grade1 grade2
  
  
where name[i] and ID[i] are strings of no more than 10 characters with no space, grade[i] is an integer in [0, 100], grade1 and grade2 are the boundaries of the grade's interval. It is guaranteed that all the grades are distinct.
  
  
Output Specification:
  
  
For each test case you should output the student records of which the grades are in the given interval [grade1, grade2] and are in non-increasing order. Each student record occupies a line with the student's name and ID, separated by one space. If there is no student's grade in that interval, output "NONE" instead.
  
  Sample Input 1:
  
  
4 Tom CS000001 59 Joe Math990112 89 Mike CS991301 100 Mary EE990830 95 60 100
  
  Sample Output 1:
  
  
Mike CS991301 Mary EE990830 Joe Math990112
  
  Sample Input 2:
  
  
2 Jean AA980920 60 Ann CS01 80 90 95
  
  Sample Output 2:
  
  
NONE
  
  


  
  
N个学生name，id， grade
  
  
分数grade 唯一,范围[0,100]
  
  
求分数在[grade1,grade2]范围内的
  
  
用得到vector 和pair。也可以直接用两个数组开到101，并且初值标记；
  
  
pair 链接http://www.cnblogs.com/cszlg/archive/2013/03/10/2952807.html
 
 

评测结果
 
 
时间
结果
得分
题目
语言
用时(ms)
内存(kB)
用户
8月09日
 11:44
答案正确
25
1083
C++
 (g++ 4.7.2)
1
436
datrilla
测试点
 
 
测试点
结果
用时(ms)
内存(kB)
得分/满分
0
答案正确
1
436
14/14
1
答案正确
1
308
1/1
2
答案正确
1
308
5/5
3
答案正确
1
312
5/5

#include<iostream> 
#include<vector>
#include<string>
using namespace std;  
#define max 101 
void readln(vector<pair<string, string> >*LG, int N)
{ 
  int grade; 
  string name;
  string id;
  while (N--)
  { 
    cin >> name >> id >> grade; 
    (*LG)[grade] .first= name;
    (*LG)[grade] .second= id;
  }
}
bool display(vector<pair<string, string> >*LG, int grade1, int grade2)
{ 
  bool sign = true;
  for (;grade2 >= grade1;grade2--)
  { 
    if (!(*LG)[grade2].first.empty())
    {
      cout << (*LG)[grade2].first << " " << (*LG)[grade2].second << endl;
      sign = false;
    }
  }
  return sign;
} 
int main()
{ 
  vector<pair<string,string> >LG(max);
  int N,grade1,grade2;  
  cin >> N; 
  readln(&LG, N);
  cin >> grade1 >> grade2; 
  if (display(&LG, grade1, grade2))cout << "NONE" << endl;  
  system("pause");
  return 0;
}