-
Notifications
You must be signed in to change notification settings - Fork 0
/
custom_sort.cpp
38 lines (35 loc) · 753 Bytes
/
custom_sort.cpp
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<iostream>
#include<cstdlib>
#include<algorithm>
struct data
{
std::string name;
int marks;
};
data a[100];
int compare(data a, data b)
{
if(a.marks!=b.marks)
return a.marks<b.marks;
//If 2 people have the same marks, print the person whose name is lexicographically smaller first
else if(a.marks==b.marks)
return a.name<b.name;
}
int main()
{
int n;
std::cout<<"Enter the number of elements : ";
std::cin>>n;
std::cout<<"Enter the name and marks : \n";
for(int i=0;i<n;i++)
{
std::cin>>a[i].name;
std::cin>>a[i].marks;
}
std::sort(a,a+n,compare);
for(int i=0;i<n;i++)
{
std::cout<<a[i].name<<" ";
std::cout<<a[i].marks<<"\n";
}
}