A 送分题 #include <iostream> #include <map> #include <set> #include <vector> #include <algorithm> using namespace std; int main (){ vector<long long> V; long long n; while(cin>>n) {V.push_back(n);} n=V.back();V.pop_back(); sort(V.begin(),V.e...