1 solutions
-
0
C++ :
#include<iostream> #include<algorithm> using namespace std; struct cai { char name[50]; double price; int fl; }data[100]; bool cmp(cai a,cai b) { if(a.price<b.price) return true; return false; } int main() { int i,n; while(cin>>n) { for(i=0;i<n;i++) {cin>>data[i].name>>data[i].price>>data[i].fl; if(data[i].fl==0) data[i].price*=2; } sort(data,data+n,cmp); for(i=0;i<n;i++) cout<<data[i].name<<endl; cout<<endl<<data[0].name<<endl; } return 0; }
- 1
Information
- ID
- 18096
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By